L_CODES 45 other-licenses/zlib/deflate.h #define HEAP_SIZE (2*L_CODES+1) L_CODES 203 other-licenses/zlib/deflate.h int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ L_CODES 210 other-licenses/zlib/deflate.h uch depth[2*L_CODES+1]; L_CODES 90 other-licenses/zlib/trees.c local ct_data static_ltree[L_CODES+2]; L_CODES 130 other-licenses/zlib/trees.c {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; L_CODES 303 other-licenses/zlib/trees.c gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); L_CODES 340 other-licenses/zlib/trees.c for (i = 0; i < L_CODES+2; i++) { L_CODES 342 other-licenses/zlib/trees.c static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); L_CODES 417 other-licenses/zlib/trees.c for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; L_CODES 845 other-licenses/zlib/trees.c Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, L_CODES 3 other-licenses/zlib/trees.h local const ct_data static_ltree[L_CODES+2] = {