L_CODES            45 third_party/zlib/deflate.h #define HEAP_SIZE (2*L_CODES+1)
L_CODES           208 third_party/zlib/deflate.h     int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
L_CODES           215 third_party/zlib/deflate.h     uch depth[2*L_CODES+1];
L_CODES            91 third_party/zlib/trees.c local ct_data static_ltree[L_CODES+2];
L_CODES           131 third_party/zlib/trees.c {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
L_CODES           306 third_party/zlib/trees.c     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
L_CODES           343 third_party/zlib/trees.c     for (i = 0; i < L_CODES+2; i++) {
L_CODES           345 third_party/zlib/trees.c                 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
L_CODES           421 third_party/zlib/trees.c     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
L_CODES           849 third_party/zlib/trees.c     Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
L_CODES             3 third_party/zlib/trees.h local const ct_data static_ltree[L_CODES+2] = {