2759   } sub;        /* submode */  member
2872       if (((z->state->sub.method = NEXTBYTE) & 0xf) != DEFLATED)
2876         z->state->sub.marker = 5;       /* can't try inflateSync */
2879       if ((z->state->sub.method >> 4) + 8 > z->state->wbits)
2883         z->state->sub.marker = 5;       /* can't try inflateSync */
2893         z->state->sub.marker = 5;       /* can't try inflateSync */
2896       if (((z->state->sub.method << 8) + b) % 31)
2900         z->state->sub.marker = 5;       /* can't try inflateSync */
2912         z->state->sub.marker = 0;       /* can try inflateSync */
2918       inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was);
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)
2945         z->state->sub.marker = 5;       /* can't try inflateSync */
2962   z->state->sub.marker = 0;       /* can try inflateSync */
2998     z->state->sub.marker = 0;
3003   m = z->state->sub.marker;
3021   z->state->sub.marker = m;
3080   } sub;                /* submode */  member
3216     ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
3219     inflate_codes_free(s->sub.decode.codes, z);
3220     inflate_trees_free(s->sub.decode.td, z);
3221     inflate_trees_free(s->sub.decode.tl, z);
3298             s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z);
3299             if (s->sub.decode.codes == Z_NULL)
3304             s->sub.decode.tl = Z_NULL;  /* don't try to free these */
3305             s->sub.decode.td = Z_NULL;
3333       s->sub.left = (uInt)b & 0xffff;
3335       Tracev((stderr, "inflate:       stored length %u\n", s->sub.left));
3336       s->mode = s->sub.left ? STORED : TYPE;
3342       t = s->sub.left;
3348       if ((s->sub.left -= t) != 0)
3357       s->sub.trees.table = t = (uInt)b & 0x3fff;
3370       if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
3375       s->sub.trees.nblens = t;
3377       s->sub.trees.index = 0;
3381       while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
3384         s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
3387       while (s->sub.trees.index < 19)
3388         s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
3389       s->sub.trees.bb = 7;
3390       t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
3391                              &s->sub.trees.tb, z);
3399       s->sub.trees.index = 0;
3403       while (t = s->sub.trees.table,
3404              s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
3409         t = s->sub.trees.bb;
3411         h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
3417           s->sub.trees.blens[s->sub.trees.index++] = c;
3427           i = s->sub.trees.index;
3428           t = s->sub.trees.table;
3437           c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
3439             s->sub.trees.blens[i++] = c;
3441           s->sub.trees.index = i;
3444       inflate_trees_free(s->sub.trees.tb, z);
3445       s->sub.trees.tb = Z_NULL;
3453         t = s->sub.trees.table;
3455                                   s->sub.trees.blens, &bl, &bd, &tl, &td, z);
3471         ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
3472         s->sub.decode.codes = c;
3473         s->sub.decode.tl = tl;
3474         s->sub.decode.td = td;
3482       inflate_codes_free(s->sub.decode.codes, z);
3483       inflate_trees_free(s->sub.decode.td, z);
3484       inflate_trees_free(s->sub.decode.tl, z);
4111   } sub;                /* submode */  member
4158   inflate_codes_statef *c = s->sub.decode.codes;  /* codes state */
4180       c->sub.code.need = c->lbits;
4181       c->sub.code.tree = c->ltree;
4184       j = c->sub.code.need;
4186       t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4191         c->sub.lit = t->base;
4200         c->sub.copy.get = e & 15;
4207         c->sub.code.need = e;
4208         c->sub.code.tree = t->next;
4222       j = c->sub.copy.get;
4226       c->sub.code.need = c->dbits;
4227       c->sub.code.tree = c->dtree;
4231       j = c->sub.code.need;
4233       t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4238         c->sub.copy.get = e & 15;
4239         c->sub.copy.dist = t->base;
4245         c->sub.code.need = e;
4246         c->sub.code.tree = t->next;
4254       j = c->sub.copy.get;
4256       c->sub.copy.dist += (uInt)b & inflate_mask[j];
4258       Tracevv((stderr, "inflate:         distance %u\n", c->sub.copy.dist));
4262       f = (uInt)(q - s->window) < c->sub.copy.dist ?
4263           s->end - (c->sub.copy.dist - (q - s->window)) :
4264           q - c->sub.copy.dist;
4266       f = q - c->sub.copy.dist;
4267       if ((uInt)(q - s->window) < c->sub.copy.dist)
4268         f = s->end - (c->sub.copy.dist - (q - s->window));
4282       OUTBYTE(c->sub.lit)