Lines Matching refs:trees

606     } trees;            /* if DTREE, decoding info for trees */  member
748     ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
889       s->sub.trees.table = t = (uInt)b & 0x3fff;
902       if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
907       s->sub.trees.nblens = t;
909       s->sub.trees.index = 0;
913       while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
916         s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
919       while (s->sub.trees.index < 19)
920         s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
921       s->sub.trees.bb = 7;
922       t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
923                              &s->sub.trees.tb, z);
929           ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
934       s->sub.trees.index = 0;
938       while (t = s->sub.trees.table,
939              s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
944         t = s->sub.trees.bb;
946         h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
952           s->sub.trees.blens[s->sub.trees.index++] = c;
962           i = s->sub.trees.index;
963           t = s->sub.trees.table;
967             ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
973           c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
975             s->sub.trees.blens[i++] = c;
977           s->sub.trees.index = i;
980       inflate_trees_free(s->sub.trees.tb, z);
981       s->sub.trees.tb = Z_NULL;
989         t = s->sub.trees.table;
991                                   s->sub.trees.blens, &bl, &bd, &tl, &td, z);
996             ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
1010         ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));