Lines Matching defs:need
71 /* XXX doesn't seem to need anything at all, but this is for consistency. */
676 need_more, /* block not completed, need more input or more output */
678 finish_started, /* finish started, need only more output at next deflate */
1394 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1505 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1766 * at the end of the input file. We need MAX_MATCH bytes
1861 * at the end of the input file. We need MAX_MATCH bytes
2062 * need for the L_CODES extra codes used during heap construction. However
2664 * Generate the codes for a given tree and bit counts (which need not be
3398 uLong need; /* stream check value */
3553 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
3558 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
3563 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
3568 z->state->sub.check.need += (uLong)NEXTBYTE;
3569 z->adler = z->state->sub.check.need;
3574 z->msg = "need dictionary";
3602 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
3607 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
3612 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
3617 z->state->sub.check.need += (uLong)NEXTBYTE;
3619 if (z->state->sub.check.was != z->state->sub.check.need)
3640 z->msg = "need more for packet flush";
3676 * will have been updated if need be.
4009 you only need two codes (1+3). Hmm.
4347 * will have been updated if need be.
4706 h--; /* don't need to update q */
5097 uInt need; /* bits needed */
5168 c->sub.code.need = c->lbits;
5173 j = c->sub.code.need;
5196 c->sub.code.need = e;
5215 c->sub.code.need = c->dbits;
5221 j = c->sub.code.need;
5235 c->sub.code.need = e;
5612 "need dictionary", /* Z_NEED_DICT 2 */