Lines Matching refs:trees

629     } trees;            /* if DTREE, decoding info for trees */  member
771     ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
912       s->sub.trees.table = t = (uInt)b & 0x3fff;
925       if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
930       s->sub.trees.nblens = t;
932       s->sub.trees.index = 0;
936       while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
939         s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
942       while (s->sub.trees.index < 19)
943         s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
944       s->sub.trees.bb = 7;
945       t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
946                              &s->sub.trees.tb, z);
954       s->sub.trees.index = 0;
958       while (t = s->sub.trees.table,
959              s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
964         t = s->sub.trees.bb;
966         h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
972           s->sub.trees.blens[s->sub.trees.index++] = c;
982           i = s->sub.trees.index;
983           t = s->sub.trees.table;
992           c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
994             s->sub.trees.blens[i++] = c;
996           s->sub.trees.index = i;
999       inflate_trees_free(s->sub.trees.tb, z);
1000       s->sub.trees.tb = Z_NULL;
1008         t = s->sub.trees.table;
1010                                   s->sub.trees.blens, &bl, &bd, &tl, &td, z);
1026         ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));