Lines Matching refs:sub
2764 * establish sub-heaps of increasing lengths:
3408 } sub; /* submode */
3534 if (((s->sub.method = NEXTBYTE) & 0xf) != Z_DEFLATED)
3538 s->sub.marker = 5; /* can't try inflateSync */
3541 if ((s->sub.method >> 4) + 8 > s->wbits)
3545 s->sub.marker = 5; /* can't try inflateSync */
3552 if (((s->sub.method << 8) + b) % 31)
3556 s->sub.marker = 5; /* can't try inflateSync */
3568 s->sub.check.need = (uLong)NEXTBYTE << 24;
3572 s->sub.check.need += (uLong)NEXTBYTE << 16;
3576 s->sub.check.need += (uLong)NEXTBYTE << 8;
3580 s->sub.check.need += (uLong)NEXTBYTE;
3581 z->adler = s->sub.check.need;
3587 s->sub.marker = 0; /* can try inflateSync */
3594 s->sub.marker = 0; /* can try inflateSync */
3602 inflate_blocks_reset(s->blocks, z, &s->sub.check.was);
3611 s->sub.check.need = (uLong)NEXTBYTE << 24;
3615 s->sub.check.need += (uLong)NEXTBYTE << 16;
3619 s->sub.check.need += (uLong)NEXTBYTE << 8;
3623 s->sub.check.need += (uLong)NEXTBYTE;
3625 if (s->sub.check.was != s->sub.check.need)
3629 s->sub.marker = 5; /* can't try inflateSync */
3689 s->sub.marker = 0;
3694 m = s->sub.marker;
3713 s->sub.marker = m;
3891 } sub; /* submode */
4018 ZFREE(z, s->sub.trees.blens);
4020 inflate_codes_free(s->sub.decode.codes, z);
4103 s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z);
4104 if (s->sub.decode.codes == Z_NULL)
4136 s->sub.left = (uInt)b & 0xffff;
4138 Tracev((stderr, "inflate: stored length %u\n", s->sub.left));
4139 s->mode = s->sub.left ? STORED : (s->last ? DRY : TYPE);
4145 t = s->sub.left;
4151 if ((s->sub.left -= t) != 0)
4160 s->sub.trees.table = t = (uInt)b & 0x3fff;
4171 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
4177 s->sub.trees.index = 0;
4181 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
4184 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
4187 while (s->sub.trees.index < 19)
4188 s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
4189 s->sub.trees.bb = 7;
4190 t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
4191 &s->sub.trees.tb, s->hufts, z);
4197 ZFREE(z, s->sub.trees.blens);
4202 s->sub.trees.index = 0;
4206 while (t = s->sub.trees.table,
4207 s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
4212 t = s->sub.trees.bb;
4214 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
4220 s->sub.trees.blens[s->sub.trees.index++] = c;
4230 i = s->sub.trees.index;
4231 t = s->sub.trees.table;
4235 ZFREE(z, s->sub.trees.blens);
4241 c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
4243 s->sub.trees.blens[i++] = c;
4245 s->sub.trees.index = i;
4248 s->sub.trees.tb = Z_NULL;
4256 t = s->sub.trees.table;
4258 s->sub.trees.blens, &bl, &bd, &tl, &td,
4264 ZFREE(z, s->sub.trees.blens);
4276 s->sub.decode.codes = c;
4278 ZFREE(z, s->sub.trees.blens);
4285 inflate_codes_free(s->sub.decode.codes, z);
5040 } sub; /* submode */
5088 inflate_codes_statef *c = s->sub.decode.codes; /* codes state */
5110 c->sub.code.need = c->lbits;
5111 c->sub.code.tree = c->ltree;
5114 j = c->sub.code.need;
5116 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
5121 c->sub.lit = t->base;
5130 c->sub.copy.get = e & 15;
5137 c->sub.code.need = e;
5138 c->sub.code.tree = t + t->base;
5152 j = c->sub.copy.get;
5156 c->sub.code.need = c->dbits;
5157 c->sub.code.tree = c->dtree;
5161 j = c->sub.code.need;
5163 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
5168 c->sub.copy.get = e & 15;
5169 c->sub.copy.dist = t->base;
5175 c->sub.code.need = e;
5176 c->sub.code.tree = t + t->base;
5184 j = c->sub.copy.get;
5186 c->sub.copy.dist += (uInt)b & inflate_mask[j];
5188 Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist));
5191 f = q - c->sub.copy.dist;
5206 OUTBYTE(c->sub.lit)