int inflate_trees_bits(int[] c, // 19 code lengths int[] bb, // bits tree desired/actual depth int[] tb, // bits tree result int[] hp, // space for trees ZStream z // for messages ){ int result; initWorkArea(19); hn[0]=0; result = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v); if(result == Z_DATA_ERROR){ z.msg = "oversubscribed dynamic bit lengths tree"; } else if(result == Z_BUF_ERROR || bb[0] == 0){ z.msg = "incomplete dynamic bit lengths tree"; result = Z_DATA_ERROR; } return result; }
InfTree.inflate_trees_fixed(bl, bd, tl, td, z); codes.init(bl[0], bd[0], tl[0], 0, td[0], 0); t = inftree.inflate_trees_bits(blens, bb, tb, hufts, z); if (t != Z_OK){ r = t; bd[0] = 6; // must be <= 9 for lookahead assumptions t = table; t = inftree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tli, tdi, hufts, z);
static int inflate_trees_bits(int[] c, // 19 code lengths int[] bb, // bits tree desired/actual depth int[] tb, // bits tree result int[] hp, // space for trees ZStream z // for messages ){ int r; int[] hn = new int[1]; // hufts used in space int[] v=new int[19]; // work area for huft_build r = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v); if (r == Z_DATA_ERROR){ z.msg = "oversubscribed dynamic bit lengths tree"; } else if (r == Z_BUF_ERROR || bb[0] == 0){ z.msg = "incomplete dynamic bit lengths tree"; r = Z_DATA_ERROR; } return r; }
InfTree.inflate_trees_fixed(bl, bd, tl, td, z); codes.init(bl[0], bd[0], tl[0], 0, td[0], 0); t = inftree.inflate_trees_bits(blens, bb, tb, hufts, z); if (t != Z_OK){ r = t; bd[0] = 6; // must be <= 9 for lookahead assumptions t = table; t = inftree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tli, tdi, hufts, z);
r = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v); if (r != Z_OK || bl[0] == 0){ if(r == Z_DATA_ERROR){ r = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);
InfTree.inflate_trees_fixed(bl, bd, tl, td, z); codes.init(bl[0], bd[0], tl[0], 0, td[0], 0); t = inftree.inflate_trees_bits(blens, bb, tb, hufts, z); if (t != Z_OK){ r = t; bd[0] = 6; // must be <= 9 for lookahead assumptions t = table; t = inftree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tli, tdi, hufts, z);
int inflate_trees_bits(int[] c, // 19 code lengths int[] bb, // bits tree desired/actual depth int[] tb, // bits tree result int[] hp, // space for trees ZStream z // for messages ){ int result; initWorkArea(19); hn[0]=0; result = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v); if(result == Z_DATA_ERROR){ z.msg = "oversubscribed dynamic bit lengths tree"; } else if(result == Z_BUF_ERROR || bb[0] == 0){ z.msg = "incomplete dynamic bit lengths tree"; result = Z_DATA_ERROR; } return result; }
int[][] td=new int[1][]; InfTree.inflate_trees_fixed(bl, bd, tl, td, z); codes.init(bl[0], bd[0], tl[0], 0, td[0], 0, z); t = inftree.inflate_trees_bits(blens, bb, tb, hufts, z); if (t != Z_OK){ r = t; t = inftree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tl, td, hufts, z);
int inflate_trees_bits(int[] c, // 19 code lengths int[] bb, // bits tree desired/actual depth int[] tb, // bits tree result int[] hp, // space for trees ZStream z // for messages ){ int result; initWorkArea(19); hn[0]=0; result = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v); if(result == Z_DATA_ERROR){ z.msg = "oversubscribed dynamic bit lengths tree"; } else if(result == Z_BUF_ERROR || bb[0] == 0){ z.msg = "incomplete dynamic bit lengths tree"; result = Z_DATA_ERROR; } return result; }
int[][] td=new int[1][]; InfTree.inflate_trees_fixed(bl, bd, tl, td, z); codes.init(bl[0], bd[0], tl[0], 0, td[0], 0, z); t = inftree.inflate_trees_bits(blens, bb, tb, hufts, z); if (t != Z_OK){ r = t; t = inftree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tl, td, hufts, z);
int inflate_trees_bits(int[] c, // 19 code lengths int[] bb, // bits tree desired/actual depth int[] tb, // bits tree result int[] hp, // space for trees ZStream z // for messages ){ int result; initWorkArea(19); hn[0]=0; result = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v); if(result == Z_DATA_ERROR){ z.msg = "oversubscribed dynamic bit lengths tree"; } else if(result == Z_BUF_ERROR || bb[0] == 0){ z.msg = "incomplete dynamic bit lengths tree"; result = Z_DATA_ERROR; } return result; }
int[][] td=new int[1][]; InfTree.inflate_trees_fixed(bl, bd, tl, td, z); codes = new InfCodes(bl[0], bd[0], tl[0], td[0], z); t = InfTree.inflate_trees_bits(blens, bb, tb, hufts, z); if (t != Z_OK){ r = t; bd[0] = 6; // must be <= 9 for lookahead assumptions t = table; t = InfTree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tl, td, hufts, z); if (t != Z_OK){
int inflate_trees_bits(int[] c, // 19 code lengths int[] bb, // bits tree desired/actual depth int[] tb, // bits tree result int[] hp, // space for trees ZStream z // for messages ){ int result; initWorkArea(19); hn[0]=0; result = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v); if(result == Z_DATA_ERROR){ z.msg = "oversubscribed dynamic bit lengths tree"; } else if(result == Z_BUF_ERROR || bb[0] == 0){ z.msg = "incomplete dynamic bit lengths tree"; result = Z_DATA_ERROR; } return result; }
initWorkArea(288); hn[0]=0; result = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v); if (result != Z_OK || bl[0] == 0){ if(result == Z_DATA_ERROR){ initWorkArea(288); result = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);
initWorkArea(288); hn[0]=0; result = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v); if (result != Z_OK || bl[0] == 0){ if(result == Z_DATA_ERROR){ initWorkArea(288); result = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);
initWorkArea(288); hn[0]=0; result = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v); if (result != Z_OK || bl[0] == 0){ if(result == Z_DATA_ERROR){ initWorkArea(288); result = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);
initWorkArea(288); hn[0]=0; result = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v); if (result != Z_OK || bl[0] == 0){ if(result == Z_DATA_ERROR){ initWorkArea(288); result = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);
initWorkArea(288); hn[0]=0; result = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v); if (result != Z_OK || bl[0] == 0){ if(result == Z_DATA_ERROR){ initWorkArea(288); result = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);