BL_CODES          327 net/zlib.c         struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */
BL_CODES         1515 net/zlib.c     local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
BL_CODES         1518 net/zlib.c     local const uch bl_order[BL_CODES]
BL_CODES         1576 net/zlib.c     {(ct_data *)0, extra_blbits, 0,      BL_CODES, MAX_BL_BITS};
BL_CODES         1789 net/zlib.c         for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
BL_CODES         2191 net/zlib.c         for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
BL_CODES         2214 net/zlib.c         Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,