matchLength += ZSTD_count(ip+matchLength+1, match+matchLength+1, iend) +1;
if (matchLength > matchEndIdx - matchIndex)
- matchEndIdx = matchIndex + matchLength;
+ matchEndIdx = matchIndex + (U32)matchLength;
if (ip+matchLength == iend) /* equal : no way to know if inf or sup */
break; /* drop , to guarantee consistency ; miss a bit of compression, but required to not corrupt the tree */
if (matchLength > bestLength)
{
if (matchLength > matchEndIdx - matchIndex)
- matchEndIdx = matchIndex + matchLength;
+ matchEndIdx = matchIndex + (U32)matchLength;
if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit(current-matchIndex+1) - ZSTD_highbit((U32)offsetPtr[0]+1)) )
bestLength = matchLength, *offsetPtr = current - matchIndex;
if (ip+matchLength == iend) /* equal : no way to know if inf or sup */
}
if (matchLength > matchEndIdx - matchIndex)
- matchEndIdx = matchIndex + matchLength;
+ matchEndIdx = matchIndex + (U32)matchLength;
if (ip+matchLength == iend) /* equal : no way to know if inf or sup */
break; /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt the tree */
if (matchLength > bestLength)
{
if (matchLength > matchEndIdx - matchIndex)
- matchEndIdx = matchIndex + matchLength;
+ matchEndIdx = matchIndex + (U32)matchLength;
if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit(current-matchIndex+1) - ZSTD_highbit((U32)offsetPtr[0]+1)) )
bestLength = matchLength, *offsetPtr = current - matchIndex;
if (ip+matchLength == iend) /* equal : no way to know if inf or sup */
case ZSTD_btlazy2:
ZSTD_updateTree(zc, iend-8, iend, 1 << zc->params.searchLog, zc->params.searchLength);
- zc->nextToUpdate = iend - zc->base;
+ zc->nextToUpdate = (U32)(iend - zc->base);
break;
default: