Lines Matching defs:ins_h
382 uInt ins_h; /* hash index of string to be inserted */
388 /* Number of bits by which ins_h must be shifted at each input
709 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
710 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
711 s->head[s->ins_h] = (Pos)(str))
852 * s->lookahead stays null, so s->ins_h will be recomputed at the next
855 s->ins_h = s->window[0];
856 UPDATE_HASH(s, s->ins_h, s->window[1]);
1250 s->ins_h = 0;
1523 s->ins_h = s->window[s->strstart];
1524 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1529 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1690 s->ins_h = s->window[s->strstart];
1691 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
1695 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not