Lines Matching defs:need
606 need_more, /* block not completed, need more input or more output */
608 finish_started, /* finish started, need only more output at next deflate */
1314 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1633 * at the end of the input file. We need MAX_MATCH bytes
1727 * at the end of the input file. We need MAX_MATCH bytes
1919 * need for the L_CODES extra codes used during heap construction. However
2326 * Generate the codes for a given tree and bit counts (which need not be
3074 uLong need; /* stream check value */
3239 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
3243 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
3247 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
3251 z->state->sub.check.need += (uLong)NEXTBYTE;
3252 z->adler = z->state->sub.check.need;
3257 z->msg = (char*)"need dictionary";
3282 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
3286 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
3290 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
3294 z->state->sub.check.need += (uLong)NEXTBYTE;
3296 if (z->state->sub.check.was != z->state->sub.check.need)
3317 z->msg = (char *)"need more for packet flush";
3352 * will have been updated if need be.
3661 you only need two codes (1+3). Hmm.
4028 * will have been updated if need be.
4383 h--; /* don't need to update q */
4634 uInt need; /* bits needed */
4655 inflate_huft *td; /* need separate declaration for Borland C++ */
4711 c->sub.code.need = c->lbits;
4715 j = c->sub.code.need;
4738 c->sub.code.need = e;
4757 c->sub.code.need = c->dbits;
4762 j = c->sub.code.need;
4776 c->sub.code.need = e;
4974 inflate_huft *td; /* need separate declaration for Borland C++ */
5135 "need dictionary", /* Z_NEED_DICT 2 */