bl_tree           943 tools/packfi2/deflate.c     ds->bl_desc.dyn_tree = ds->bl_tree;
bl_tree           194 tools/packfi2/deflate.h     struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */
bl_tree           393 tools/packfi2/trees.c     s->bl_desc.dyn_tree = s->bl_tree;
bl_tree           419 tools/packfi2/trees.c     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
bl_tree           681 tools/packfi2/trees.c         if (tree == s->bl_tree) {
bl_tree           728 tools/packfi2/trees.c             s->bl_tree[curlen].Freq += count;
bl_tree           730 tools/packfi2/trees.c             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
bl_tree           731 tools/packfi2/trees.c             s->bl_tree[REP_3_6].Freq++;
bl_tree           733 tools/packfi2/trees.c             s->bl_tree[REPZ_3_10].Freq++;
bl_tree           735 tools/packfi2/trees.c             s->bl_tree[REPZ_11_138].Freq++;
bl_tree           773 tools/packfi2/trees.c             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
bl_tree           777 tools/packfi2/trees.c                 send_code(s, curlen, s->bl_tree); count--;
bl_tree           780 tools/packfi2/trees.c             send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
bl_tree           783 tools/packfi2/trees.c             send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
bl_tree           786 tools/packfi2/trees.c             send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
bl_tree           823 tools/packfi2/trees.c         if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
bl_tree           853 tools/packfi2/trees.c         send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);