Lines Matching refs:need
106 "need dictionary", /* Z_NEED_DICT 2 */
681 need_more, /* block not completed, need more input or more output */
683 finish_started, /* finish started, need only more output at next deflate */
1372 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1482 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1744 * at the end of the input file. We need MAX_MATCH bytes
1840 * at the end of the input file. We need MAX_MATCH bytes
2038 * need for the L_CODES extra codes used during heap construction. However
2673 * Generate the codes for a given tree and bit counts (which need not be
3405 uLong need; /* stream check value */
3568 s->sub.check.need = (uLong)NEXTBYTE << 24;
3572 s->sub.check.need += (uLong)NEXTBYTE << 16;
3576 s->sub.check.need += (uLong)NEXTBYTE << 8;
3580 s->sub.check.need += (uLong)NEXTBYTE;
3581 z->adler = s->sub.check.need;
3586 z->msg = (char*)"need dictionary";
3611 s->sub.check.need = (uLong)NEXTBYTE << 24;
3615 s->sub.check.need += (uLong)NEXTBYTE << 16;
3619 s->sub.check.need += (uLong)NEXTBYTE << 8;
3623 s->sub.check.need += (uLong)NEXTBYTE;
3625 if (s->sub.check.was != s->sub.check.need)
3995 you only need two codes (1+3). Hmm.
4637 h--; /* don't need to update q */
5033 uInt need; /* bits needed */
5054 inflate_huft *td; /* need separate declaration for Borland C++ */
5110 c->sub.code.need = c->lbits;
5114 j = c->sub.code.need;
5137 c->sub.code.need = e;
5156 c->sub.code.need = c->dbits;
5161 j = c->sub.code.need;
5175 c->sub.code.need = e;
5363 inflate_huft *td; /* need separate declaration for Borland C++ */