unsigned int str = s->strstart - s->insert;
s->ins_h = s->window[str];
if (str >= 1)
- functable.insert_string(s, str + 2 - MIN_MATCH, 1);
+ functable.quick_insert_string(s, str + 2 - MIN_MATCH);
#if MIN_MATCH != 3
#error Call insert_string() MIN_MATCH-3 more times
while (s->insert) {
- functable.insert_string(s, str, 1);
+ functable.quick_insert_string(s, str);
str++;
s->insert--;
if (s->lookahead + s->insert < MIN_MATCH)
unsigned int str = s->strstart - s->insert;
s->ins_h = s->window[str];
if (str >= 1)
- functable.insert_string(s, str + 2 - MIN_MATCH, 1);
+ functable.quick_insert_string(s, str + 2 - MIN_MATCH);
#if MIN_MATCH != 3
#error Call insert_string() MIN_MATCH-3 more times
while (s->insert) {
- functable.insert_string(s, str, 1);
+ functable.quick_insert_string(s, str);
str++;
s->insert--;
if (s->lookahead + s->insert < MIN_MATCH)
*/
hash_head = NIL;
if (s->lookahead >= MIN_MATCH) {
- hash_head = functable.insert_string(s, s->strstart, 1);
+ hash_head = functable.quick_insert_string(s, s->strstart);
}
/* Find the longest match, discarding those <= prev_length.
s->strstart++;
#ifdef NOT_TWEAK_COMPILER
do {
- functable.insert_string(s, s->strstart, 1);
+ functable.quick_insert_string(s, s->strstart);
s->strstart++;
/* strstart never exceeds WSIZE-MAX_MATCH, so there are
* always MIN_MATCH bytes ahead.
#ifndef NOT_TWEAK_COMPILER
functable.insert_string(s, s->strstart + 2 - MIN_MATCH, MIN_MATCH - 2);
#else
- functable.insert_string(s, s->strstart + 2 - MIN_MATCH, 1);
+ functable.quick_insert_string(s, s->strstart + 2 - MIN_MATCH);
#if MIN_MATCH != 3
#warning Call insert_string() MIN_MATCH-3 more times
#endif
if (match.match_length) {
if (match.strstart >= match.orgstart) {
- functable.insert_string(s, match.strstart, 1);
+ functable.quick_insert_string(s, match.strstart);
}
}
}
#ifdef NOT_TWEAK_COMPILER
do {
if (LIKELY(match.strstart >= match.orgstart)) {
- functable.insert_string(s, match.strstart, 1);
+ functable.quick_insert_string(s, match.strstart);
}
match.strstart++;
/* strstart never exceeds WSIZE-MAX_MATCH, so there are
#ifndef NOT_TWEAK_COMPILER
functable.insert_string(s, match.strstart + 2 - MIN_MATCH, MIN_MATCH - 2);
#else
- functable.insert_string(s, match.strstart + 2 - MIN_MATCH, 1);
+ functable.quick_insert_string(s, match.strstart + 2 - MIN_MATCH);
#if MIN_MATCH != 3
#warning Call insert_string() MIN_MATCH-3 more times
#endif
} else {
hash_head = 0;
if (s->lookahead >= MIN_MATCH) {
- hash_head = functable.insert_string(s, s->strstart, 1);
+ hash_head = functable.quick_insert_string(s, s->strstart);
}
/* set up the initial match to be a 1 byte literal */
/* now, look ahead one */
if (s->lookahead > MIN_LOOKAHEAD && (uint32_t)(current_match.strstart + current_match.match_length) < (s->window_size - MIN_LOOKAHEAD)) {
s->strstart = current_match.strstart + current_match.match_length;
- hash_head = functable.insert_string(s, s->strstart, 1);
+ hash_head = functable.quick_insert_string(s, s->strstart);
/* set up the initial match to be a 1 byte literal */
next_match.match_start = 0;
*/
hash_head = NIL;
if (s->lookahead >= MIN_MATCH) {
- hash_head = functable.insert_string(s, s->strstart, 1);
+ hash_head = functable.quick_insert_string(s, s->strstart);
}
/* Find the longest match, discarding those <= prev_length.
s->prev_length -= 2;
do {
if (++s->strstart <= max_insert) {
- functable.insert_string(s, s->strstart, 1);
+ functable.quick_insert_string(s, s->strstart);
}
} while (--s->prev_length != 0);
s->match_available = 0;