Lines Matching defs:ins_h
409 uInt ins_h; /* hash index of string to be inserted */
415 /* Number of bits by which ins_h must be shifted at each input
782 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
783 match_head = s->head[s->ins_h], \
784 s->head[s->ins_h] = (Pos)(str))
787 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
788 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
789 s->head[s->ins_h] = (Pos)(str))
927 * s->lookahead stays null, so s->ins_h will be recomputed at the next
930 s->ins_h = s->window[0];
931 UPDATE_HASH(s, s->ins_h, s->window[1]);
1330 s->ins_h = 0;
1660 s->ins_h = s->window[s->strstart];
1661 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1666 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1826 s->ins_h = s->window[s->strstart];
1827 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1831 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not