Debugging 64-bit bug in new semi-canonical form..

This commit is contained in:
Alan Mishchenko 2012-09-06 23:11:34 -07:00
parent 894fc81041
commit 5b3e31bd4d
1 changed files with 12 additions and 0 deletions

View File

@ -71,7 +71,10 @@ inline int minTemp0_fast(word* pInOut, int iVar, int nWords, int* pDifStart)
{
*pDifStart = i*100;
while(temp == (temp & luckyMask(shiftSize*j)))
{
j++;
assert( j < 100 );
}
*pDifStart += 21 - j;
if( ((pInOut[i] & SFmask[iVar][0])) < ((pInOut[i] & SFmask[iVar][3])<<(3*blockSize)) )
@ -102,7 +105,10 @@ inline int minTemp1_fast(word* pInOut, int iVar, int nWords, int* pDifStart)
{
*pDifStart = i*100;
while(temp == (temp & luckyMask(shiftSize*j)))
{
j++;
assert( j < 100 );
}
*pDifStart += 21 - j;
if( ((pInOut[i] & SFmask[iVar][1])<<(blockSize)) < ((pInOut[i] & SFmask[iVar][2])<<(2*blockSize)) )
return 1;
@ -133,7 +139,10 @@ inline int minTemp2_fast(word* pInOut, int iVar, int iQ, int jQ, int nWords, int
{
*pDifStart = i*100;
while(temp == (temp & luckyMask(shiftSize*j)))
{
j++;
assert( j < 100 );
}
*pDifStart += 21 - j;
if( ((pInOut[i] & SFmask[iVar][iQ])<<(iQ*blockSize)) <= ((pInOut[i] & SFmask[iVar][jQ])<<(jQ*blockSize)) )
return 0;
@ -160,7 +169,10 @@ inline int minTemp3_fast(word* pInOut, int iVar, int start, int finish, int iQ,
{
*pDifStart = i*100;
while(temp == (temp & luckyMask(shiftSize*j)))
{
j++;
assert( j < 100 );
}
*pDifStart += 21 - j;
if( ((pInOut[i] & SFmask[iVar][iQ])<<(iQ*blockSize)) <= ((pInOut[i] & SFmask[iVar][jQ])<<(jQ*blockSize)) )