L_CODES            88 lib/zlib_deflate/deftree.c static ct_data static_ltree[L_CODES+2];
L_CODES           124 lib/zlib_deflate/deftree.c {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
L_CODES           282 lib/zlib_deflate/deftree.c     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
L_CODES           333 lib/zlib_deflate/deftree.c     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
L_CODES           770 lib/zlib_deflate/deftree.c     Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
L_CODES            27 lib/zlib_deflate/defutil.h #define HEAP_SIZE (2*L_CODES+1)
L_CODES           179 lib/zlib_deflate/defutil.h     int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
L_CODES           186 lib/zlib_deflate/defutil.h     uch depth[2*L_CODES+1];