Lines Matching defs:decode
2651 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
3566 } decode; /* if CODES, current state */
3687 inflate_codes_free(s->sub.decode.codes, z);
3688 inflate_trees_free(s->sub.decode.td, z);
3689 inflate_trees_free(s->sub.decode.tl, z);
3769 s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z);
3770 if (s->sub.decode.codes == Z_NULL)
3775 s->sub.decode.tl = Z_NULL; /* don't try to free these */
3776 s->sub.decode.td = Z_NULL;
3952 s->sub.decode.codes = c;
3953 s->sub.decode.tl = tl;
3954 s->sub.decode.td = td;
3962 inflate_codes_free(s->sub.decode.codes, z);
3963 inflate_trees_free(s->sub.decode.td, z);
3964 inflate_trees_free(s->sub.decode.tl, z);
4152 The fastest way to decode is to simply build a lookup table whose
4159 the longer codes. The time it costs to decode the longer codes is
4164 length codes can decode in one step, and dbits is the same thing for
4201 tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR
4689 inflate_codes_statef *c = s->sub.decode.codes; /* codes state */
5023 /* decode distance base of block to copy */