char sum2[SUM_LENGTH];
uint32 s1, s2, sum;
schar *map;
- extern int do_compression;
if (verbose > 2)
rprintf(FINFO,"hash search b=%d len=%d\n",s->n,(int)len);
--k;
}
- if (!do_compression) {
- /* By matching early we avoid re-reading the
- data 3 times in the case where a token
- match comes a long way after last
- match. The 3 reads are caused by the
- running match, the checksum update and the
- literal send.
-
- we don't enable this for the compressed
- case yet as the deflated token code can't
- handle it. Paul is working on it */
- if (offset-last_match >= CHUNK_SIZE+s->n &&
- (end-offset > CHUNK_SIZE)) {
- matched(f,s,buf,offset - s->n, -2);
- }
+ /* By matching early we avoid re-reading the
+ data 3 times in the case where a token
+ match comes a long way after last
+ match. The 3 reads are caused by the
+ running match, the checksum update and the
+ literal send. */
+ if (offset-last_match >= CHUNK_SIZE+s->n &&
+ (end-offset > CHUNK_SIZE)) {
+ matched(f,s,buf,offset - s->n, -2);
}
} while (++offset < end);