Lines Matching defs:need
978 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1237 * at the end of the input file. We need MAX_MATCH bytes
1332 * at the end of the input file. We need MAX_MATCH bytes
1523 * need for the L_CODES extra codes used during heap construction. However
1928 * Generate the codes for a given tree and bit counts (which need not be
2756 uLong need; /* stream check value */
2927 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
2931 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
2935 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
2939 z->state->sub.check.need += (uLong)NEXTBYTE;
2941 if (z->state->sub.check.was != z->state->sub.check.need)
2972 * will have been updated if need be.
3193 you only need two codes (1+3). Hmm.
3538 * will have been updated if need be.
3882 h--; /* don't need to update q */
4104 uInt need; /* bits needed */
4180 c->sub.code.need = c->lbits;
4184 j = c->sub.code.need;
4207 c->sub.code.need = e;
4226 c->sub.code.need = c->dbits;
4231 j = c->sub.code.need;
4245 c->sub.code.need = e;