Lines Matching defs:sub

2848 	 * the tree, establish sub-heaps of increasing lengths:
3622 } sub; /* submode */
3756 if (((z->state->sub.method = NEXTBYTE) & 0xf) != Z_DEFLATED)
3761 z->state->sub.marker = 5;
3764 if ((z->state->sub.method >> 4) + 8 > z->state->wbits)
3769 z->state->sub.marker = 5;
3777 if (((z->state->sub.method << 8) + b) % 31)
3782 z->state->sub.marker = 5;
3795 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
3800 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
3805 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
3810 z->state->sub.check.need += (uLong)NEXTBYTE;
3811 z->adler = z->state->sub.check.need;
3817 z->state->sub.marker = 0; /* can try inflateSync */
3828 z->state->sub.marker = 0;
3836 &z->state->sub.check.was);
3846 z->state->sub.check.need = (uLong)NEXTBYTE << 24;
3851 z->state->sub.check.need += (uLong)NEXTBYTE << 16;
3856 z->state->sub.check.need += (uLong)NEXTBYTE << 8;
3861 z->state->sub.check.need += (uLong)NEXTBYTE;
3863 if (z->state->sub.check.was != z->state->sub.check.need)
3868 z->state->sub.marker = 5;
3888 z->state->sub.marker = 0; /* can try inflateSync */
3954 z->state->sub.marker = 0;
3959 m = z->state->sub.marker;
3988 z->state->sub.marker = m;
4181 } sub; /* submode */
4303 s->sub.trees.blens != Z_NULL) {
4304 ZFREE(z, s->sub.trees.blens);
4305 s->sub.trees.blens = Z_NULL;
4307 if (s->mode == CODES && s->sub.decode.codes != Z_NULL) {
4308 (void) inflate_codes_free(s->sub.decode.codes, z);
4309 s->sub.decode.codes = Z_NULL;
4396 s->sub.decode.codes = inflate_codes_new(bl,
4398 if (s->sub.decode.codes == Z_NULL)
4430 s->sub.left = (uInt)b & 0xffff;
4433 s->sub.left));
4434 s->mode = s->sub.left ? STORED : (s->last ? DRY : TYPE);
4440 t = s->sub.left;
4446 if ((s->sub.left -= t) != 0)
4456 s->sub.trees.table = t = (uInt)b & 0x3fff;
4469 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t,
4476 s->sub.trees.index = 0;
4481 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
4484 s->sub.trees.blens[border[s->sub.trees.index++]] =
4488 while (s->sub.trees.index < 19)
4489 s->sub.trees.blens[border[s->sub.trees.index++]] =
4491 s->sub.trees.bb = 7;
4492 t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
4493 &s->sub.trees.tb, s->hufts, z);
4496 ZFREE(z, s->sub.trees.blens);
4497 s->sub.trees.blens = Z_NULL;
4503 s->sub.trees.index = 0;
4508 while (t = s->sub.trees.table,
4509 s->sub.trees.index < 258 + (t & 0x1f) +
4515 t = s->sub.trees.bb;
4517 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
4523 s->sub.trees.blens[s->sub.trees.index++] =
4532 i = s->sub.trees.index;
4533 t = s->sub.trees.table;
4538 ZFREE(z, s->sub.trees.blens);
4539 s->sub.trees.blens = Z_NULL;
4545 c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
4547 s->sub.trees.blens[i++] = c;
4549 s->sub.trees.index = i;
4552 s->sub.trees.tb = Z_NULL;
4562 t = s->sub.trees.table;
4565 s->sub.trees.blens, &bl, &bd, &tl, &td,
4567 ZFREE(z, s->sub.trees.blens);
4568 s->sub.trees.blens = Z_NULL;
4583 s->sub.decode.codes = c;
4592 (void) inflate_codes_free(s->sub.decode.codes, z);
5292 } sub; /* submode */
5342 inflate_codes_statef *c = s->sub.decode.codes; /* codes state */
5367 c->sub.code.need = c->lbits;
5368 c->sub.code.tree = c->ltree;
5372 j = c->sub.code.need;
5374 t = c->sub.code.tree +
5379 c->sub.lit = t->base;
5389 c->sub.copy.get = e & 15;
5395 c->sub.code.need = e;
5396 c->sub.code.tree = t + t->base;
5410 j = c->sub.copy.get;
5414 c->sub.code.need = c->dbits;
5415 c->sub.code.tree = c->dtree;
5421 j = c->sub.code.need;
5423 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
5427 c->sub.copy.get = e & 15;
5428 c->sub.copy.dist = t->base;
5433 c->sub.code.need = e;
5434 c->sub.code.tree = t + t->base;
5442 j = c->sub.copy.get;
5444 c->sub.copy.dist += (uInt)b & inflate_mask[j];
5448 c->sub.copy.dist));
5454 f = (uInt)(q - s->window) < c->sub.copy.dist ?
5455 s->end - (c->sub.copy.dist - (q - s->window)) :
5456 q - c->sub.copy.dist;
5458 f = q - c->sub.copy.dist;
5459 if ((uInt)(q - s->window) < c->sub.copy.dist)
5460 f = s->end - (c->sub.copy.dist -
5475 OUTBYTE(c->sub.lit);