Lines Matching refs:insert
147 * Insert string str in the dictionary and set match_head to the previous head
285 if (s->insert > s->strstart)
286 s->insert = s->strstart;
309 if (s->lookahead + s->insert >= MIN_MATCH) {
310 uInt str = s->strstart - s->insert;
316 while (s->insert) {
323 s->insert--;
324 if (s->lookahead + s->insert < MIN_MATCH)
578 s->insert = 0;
584 /* insert dictionary into window and hash */
607 s->insert = s->lookahead;
690 s->insert = 0;
1218 s->insert = 0;
1716 * insert in the hash tables, in the event that deflateParams() switches to
1728 s->insert = s->strstart;
1737 if (s->insert > s->strstart)
1738 s->insert = s->strstart;
1742 s->insert += MIN(used, s->w_size - s->insert);
1768 if (s->insert > s->strstart)
1769 s->insert = s->strstart;
1776 s->insert += MIN(have, s->w_size - s->insert);
1820 * for the next match, plus MIN_MATCH bytes to insert the
1831 /* Insert the string window[strstart .. strstart + 2] in the
1858 /* Insert new strings in the hash table only if the match length
1896 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1920 * for the next match, plus MIN_MATCH bytes to insert the
1931 /* Insert the string window[strstart .. strstart + 2] in the
1971 /* Do not insert strings in hash table beyond this. */
1978 /* Insert in hash table all strings up to the end of the match.
2024 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
2097 s->insert = 0;
2133 s->insert = 0;