BL_CODES 194 other-licenses/zlib/deflate.h struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ BL_CODES 67 other-licenses/zlib/trees.c local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ BL_CODES 70 other-licenses/zlib/trees.c local const uch bl_order[BL_CODES] BL_CODES 136 other-licenses/zlib/trees.c {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; BL_CODES 419 other-licenses/zlib/trees.c for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; BL_CODES 822 other-licenses/zlib/trees.c for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { BL_CODES 845 other-licenses/zlib/trees.c Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,