Lines Matching defs:ins_h
410 uInt ins_h; /* hash index of string to be inserted */
417 * Number of bits by which ins_h must be shifted at each input
816 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
817 match_head = s->head[s->ins_h], \
818 s->head[s->ins_h] = (Pos)(str))
821 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
822 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
823 s->head[s->ins_h] = (Pos)(str))
982 * two bytes). s->lookahead stays null, so s->ins_h will be
985 s->ins_h = s->window[0];
986 UPDATE_HASH(s, s->ins_h, s->window[1]);
1430 s->ins_h = 0;
1821 s->ins_h = s->window[s->strstart];
1822 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1829 * ins_h is garbage, but this is not important since
2029 s->ins_h = s->window[s->strstart];
2030 UPDATE_HASH(s, s->ins_h,
2036 * If lookahead < MIN_MATCH, ins_h is