L_CODES           182 net/zlib.c     #define HEAP_SIZE (2*L_CODES+1)
L_CODES           336 net/zlib.c         int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
L_CODES           343 net/zlib.c         uch depth[2*L_CODES+1];
L_CODES          1534 net/zlib.c     local ct_data static_ltree[L_CODES+2];
L_CODES          1570 net/zlib.c     {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
L_CODES          1736 net/zlib.c         gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
L_CODES          1787 net/zlib.c         for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
L_CODES          2214 net/zlib.c         Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,