trees 3086 net/zlib.c } trees; /* if DTREE, decoding info for trees */ trees 3228 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt)); trees 3369 net/zlib.c s->sub.trees.table = t = (uInt)b & 0x3fff; trees 3382 net/zlib.c if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL) trees 3387 net/zlib.c s->sub.trees.nblens = t; trees 3389 net/zlib.c s->sub.trees.index = 0; trees 3393 net/zlib.c while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10)) trees 3396 net/zlib.c s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7; trees 3399 net/zlib.c while (s->sub.trees.index < 19) trees 3400 net/zlib.c s->sub.trees.blens[border[s->sub.trees.index++]] = 0; trees 3401 net/zlib.c s->sub.trees.bb = 7; trees 3402 net/zlib.c t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb, trees 3403 net/zlib.c &s->sub.trees.tb, z); trees 3409 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt)); trees 3414 net/zlib.c s->sub.trees.index = 0; trees 3418 net/zlib.c while (t = s->sub.trees.table, trees 3419 net/zlib.c s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f)) trees 3424 net/zlib.c t = s->sub.trees.bb; trees 3426 net/zlib.c h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]); trees 3432 net/zlib.c s->sub.trees.blens[s->sub.trees.index++] = c; trees 3442 net/zlib.c i = s->sub.trees.index; trees 3443 net/zlib.c t = s->sub.trees.table; trees 3452 net/zlib.c c = c == 16 ? s->sub.trees.blens[i - 1] : 0; trees 3454 net/zlib.c s->sub.trees.blens[i++] = c; trees 3456 net/zlib.c s->sub.trees.index = i; trees 3459 net/zlib.c inflate_trees_free(s->sub.trees.tb, z); trees 3460 net/zlib.c s->sub.trees.tb = Z_NULL; trees 3468 net/zlib.c t = s->sub.trees.table; trees 3470 net/zlib.c s->sub.trees.blens, &bl, &bd, &tl, &td, z); trees 3475 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt)); trees 3489 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));