libs/flate/infblock.c

78     ZFREE(z, s->sub.trees.blens);
80     inflate_codes_free(s->sub.decode.codes, z);
163             s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z);
164             if (s->sub.decode.codes == Z_NULL)
196       s->sub.left = (uInt)b & 0xffff;
198       Tracev((stderr, "inflate:       stored length %u\n", s->sub.left));
199       s->mode = s->sub.left ? STORED : (s->last ? DRY : TYPE);
205       t = s->sub.left;
211       if ((s->sub.left -= t) != 0)
220       s->sub.trees.table = t = (uInt)b & 0x3fff;
231       if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
237       s->sub.trees.index = 0;
241       while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
244         s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
247       while (s->sub.trees.index < 19)
248         s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
249       s->sub.trees.bb = 7;
250       t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
251                              &s->sub.trees.tb, s->hufts, z);
257           ZFREE(z, s->sub.trees.blens);
262       s->sub.trees.index = 0;
266       while (t = s->sub.trees.table,
267              s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
272         t = s->sub.trees.bb;
274         h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
280           s->sub.trees.blens[s->sub.trees.index++] = c;
290           i = s->sub.trees.index;
291           t = s->sub.trees.table;
295             ZFREE(z, s->sub.trees.blens);
301           c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
303             s->sub.trees.blens[i++] = c;
305           s->sub.trees.index = i;
308       s->sub.trees.tb = Z_NULL;
316         t = s->sub.trees.table;
318                                   s->sub.trees.blens, &bl, &bd, &tl, &td,
324             ZFREE(z, s->sub.trees.blens);
336         s->sub.decode.codes = c;
338       ZFREE(z, s->sub.trees.blens);
345       inflate_codes_free(s->sub.decode.codes, z);