Lines Matching defs:ins_h
393 uInt ins_h; /* hash index of string to be inserted */
399 /* Number of bits by which ins_h must be shifted at each input
720 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
721 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
722 s->head[s->ins_h] = (Pos)(str))
863 * s->lookahead stays null, so s->ins_h will be recomputed at the next
866 s->ins_h = s->window[0];
867 UPDATE_HASH(s, s->ins_h, s->window[1]);
1261 s->ins_h = 0;
1534 s->ins_h = s->window[s->strstart];
1535 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1540 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1701 s->ins_h = s->window[s->strstart];
1702 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1706 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not