Lines Matching defs:bl_tree
24 * 0000009c b bl_tree
896 ct_data bl_tree[2 * BL_CODES + 1];
1004 G2.bl_tree[n].Freq = 0;
1279 if (tree == G2.bl_tree) {
1306 * during the construction of bl_tree.)
1331 G2.bl_tree[curlen].Freq += count;
1334 G2.bl_tree[curlen].Freq++;
1335 G2.bl_tree[REP_3_6].Freq++;
1337 G2.bl_tree[REPZ_3_10].Freq++;
1339 G2.bl_tree[REPZ_11_138].Freq++;
1359 * bl_tree.
1382 SEND_CODE(curlen, G2.bl_tree);
1386 SEND_CODE(curlen, G2.bl_tree);
1390 SEND_CODE(REP_3_6, G2.bl_tree);
1393 SEND_CODE(REPZ_3_10, G2.bl_tree);
1396 SEND_CODE(REPZ_11_138, G2.bl_tree);
1438 if (G2.bl_tree[bl_order[max_blindex]].Len != 0)
1467 send_bits(G2.bl_tree[bl_order[rank]].Len, 3);
2064 G2.bl_desc.dyn_tree = G2.bl_tree;