diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-02-19 13:33:21 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-02-19 13:33:21 -0800 |
| commit | ea13085fe34bed2e827fe8ec6fb7e24c6e1a5d8f (patch) | |
| tree | cf0dd47d29716f6ef34baca85a6c1b9514567b5a /src/misc/util/utilSort.c | |
| parent | c2b2e99284727cc0b1c8122b267746cf598846ab (diff) | |
| download | abc-ea13085fe34bed2e827fe8ec6fb7e24c6e1a5d8f.tar.gz abc-ea13085fe34bed2e827fe8ec6fb7e24c6e1a5d8f.tar.bz2 abc-ea13085fe34bed2e827fe8ec6fb7e24c6e1a5d8f.zip | |
Added printout of BMC tents in &ps.
Diffstat (limited to 'src/misc/util/utilSort.c')
| -rw-r--r-- | src/misc/util/utilSort.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/src/misc/util/utilSort.c b/src/misc/util/utilSort.c index 380a8885..eb2b32c3 100644 --- a/src/misc/util/utilSort.c +++ b/src/misc/util/utilSort.c @@ -509,7 +509,7 @@ void Abc_QuickSort1( word * pData, int nSize, int fDecrease ) SeeAlso [] ***********************************************************************/ -static inline void Iso_SelectSortInc( word * pData, int nSize ) +static inline void Abc_SelectSortInc( word * pData, int nSize ) { int i, j, best_i; for ( i = 0; i < nSize-1; i++ ) @@ -521,7 +521,7 @@ static inline void Iso_SelectSortInc( word * pData, int nSize ) ABC_SWAP( word, pData[i], pData[best_i] ); } } -static inline void Iso_SelectSortDec( word * pData, int nSize ) +static inline void Abc_SelectSortDec( word * pData, int nSize ) { int i, j, best_i; for ( i = 0; i < nSize-1; i++ ) @@ -543,7 +543,7 @@ void Abc_QuickSort2Inc_rec( word * pData, int l, int r ) assert( l < r ); if ( r - l < 10 ) { - Iso_SelectSortInc( pData + l, r - l + 1 ); + Abc_SelectSortInc( pData + l, r - l + 1 ); return; } while ( 1 ) @@ -569,7 +569,7 @@ void Abc_QuickSort2Dec_rec( word * pData, int l, int r ) assert( l < r ); if ( r - l < 10 ) { - Iso_SelectSortDec( pData + l, r - l + 1 ); + Abc_SelectSortDec( pData + l, r - l + 1 ); return; } while ( 1 ) @@ -596,7 +596,7 @@ void Abc_QuickSort3Inc_rec( word * pData, int l, int r ) assert( l < r ); if ( r - l < 10 ) { - Iso_SelectSortInc( pData + l, r - l + 1 ); + Abc_SelectSortInc( pData + l, r - l + 1 ); return; } while ( 1 ) @@ -631,7 +631,7 @@ void Abc_QuickSort3Dec_rec( word * pData, int l, int r ) assert( l < r ); if ( r - l < 10 ) { - Iso_SelectSortDec( pData + l, r - l + 1 ); + Abc_SelectSortDec( pData + l, r - l + 1 ); return; } while ( 1 ) @@ -678,7 +678,7 @@ void Abc_QuickSort2( word * pData, int nSize, int fDecrease ) } void Abc_QuickSort3( word * pData, int nSize, int fDecrease ) { - int i, fVerify = 0; + int i, fVerify = 1; if ( fDecrease ) { Abc_QuickSort2Dec_rec( pData, 0, nSize - 1 ); |