Lines Matching refs:time
19 * is preferable to spend more time in matches to allow very fast string
27 * time, but has a larger average cost, uses more memory and is patented.
139 * key instead of complete recalculation each time.
271 * strstart == 0 && lookahead == 1 (input done a byte at time)
339 * time through here. WIN_INIT is set to MAX_MATCH since the longest match
476 * code is written. At that time, 31*(n - 2) bits have been written, just
1071 put_byte(s, (Byte)(s->gzhead->time & 0xff));
1072 put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));
1073 put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));
1074 put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));
1373 /* Compare two bytes at a time. Note: this is not always beneficial.
1390 /* Do not waste too much time if we already have a good match: */
1423 * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
1870 * is not too large. This saves time but degrades compression.