bl_tree 309 lib/zlib_deflate/deftree.c s->bl_desc.dyn_tree = s->bl_tree; bl_tree 335 lib/zlib_deflate/deftree.c for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; bl_tree 600 lib/zlib_deflate/deftree.c if (tree == s->bl_tree) { bl_tree 648 lib/zlib_deflate/deftree.c s->bl_tree[curlen].Freq += count; bl_tree 650 lib/zlib_deflate/deftree.c if (curlen != prevlen) s->bl_tree[curlen].Freq++; bl_tree 651 lib/zlib_deflate/deftree.c s->bl_tree[REP_3_6].Freq++; bl_tree 653 lib/zlib_deflate/deftree.c s->bl_tree[REPZ_3_10].Freq++; bl_tree 655 lib/zlib_deflate/deftree.c s->bl_tree[REPZ_11_138].Freq++; bl_tree 694 lib/zlib_deflate/deftree.c do { send_code(s, curlen, s->bl_tree); } while (--count != 0); bl_tree 698 lib/zlib_deflate/deftree.c send_code(s, curlen, s->bl_tree); count--; bl_tree 701 lib/zlib_deflate/deftree.c send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); bl_tree 704 lib/zlib_deflate/deftree.c send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); bl_tree 707 lib/zlib_deflate/deftree.c send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); bl_tree 745 lib/zlib_deflate/deftree.c if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; bl_tree 778 lib/zlib_deflate/deftree.c send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); bl_tree 170 lib/zlib_deflate/defutil.h struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */