U32* largerPtr = bt + 2*(current&btMask) + 1;
U32 dummy32; /* to be nullified at the end */
const U32 windowLow = zc->lowLimit;
- U32 matchEndIdx = current;
+ U32 matchEndIdx = current+8;
hashTable[h] = current; /* Update Hash Table */
}
*smallerPtr = *largerPtr = 0;
- return (matchEndIdx > current + zc->params.searchLength) ? matchEndIdx - current - zc->params.searchLength : 1;
+ return (matchEndIdx > current + 8) ? matchEndIdx - current - 8 : 1;
}
U32* smallerPtr = bt + 2*(current&btMask);
U32* largerPtr = bt + 2*(current&btMask) + 1;
size_t bestLength = 0;
- U32 matchEndIdx = current;
+ U32 matchEndIdx = current+8;
U32 dummy32; /* to be nullified at the end */
hashTable[h] = current; /* Update Hash Table */
*smallerPtr = *largerPtr = 0;
- zc->nextToUpdate = (matchEndIdx > current + zc->params.searchLength) ? matchEndIdx - zc->params.searchLength : current+1;
+ zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
return bestLength;
}
U32* largerPtr = bt + 2*(current&btMask) + 1;
U32 dummy32; /* to be nullified at the end */
const U32 windowLow = zc->lowLimit;
- U32 matchEndIdx = current;
+ U32 matchEndIdx = current+8;
hashTable[h] = current; /* Update Hash Table */
}
*smallerPtr = *largerPtr = 0;
- return (matchEndIdx > current + zc->params.searchLength) ? matchEndIdx - current - zc->params.searchLength : 1;
+ return (matchEndIdx > current + 8) ? matchEndIdx - current - 8 : 1;
}
U32* smallerPtr = bt + 2*(current&btMask);
U32* largerPtr = bt + 2*(current&btMask) + 1;
size_t bestLength = 0;
- U32 matchEndIdx = current;
+ U32 matchEndIdx = current+8;
U32 dummy32; /* to be nullified at the end */
hashTable[h] = current; /* Update Hash Table */
*smallerPtr = *largerPtr = 0;
- zc->nextToUpdate = (matchEndIdx > current + zc->params.searchLength) ? matchEndIdx - zc->params.searchLength : current+1;
+ zc->nextToUpdate = (matchEndIdx > current + 8) ? matchEndIdx - 8 : current+1;
return bestLength;
}