lib/libz/deflate.h

211

int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */

lib/libz/deflate.h

218

uch depth[2*L_CODES+1];

lib/libz/deflate.h

47

#define HEAP_SIZE (2*L_CODES+1)

lib/libz/trees.c

130

{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};

lib/libz/trees.c

359

gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);

lib/libz/trees.c

395

for (i = 0; i < L_CODES+2; i++) {

lib/libz/trees.c

397

static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));

lib/libz/trees.c

442

for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;

lib/libz/trees.c

836

Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,

lib/libz/trees.c

84

local ct_data static_ltree[L_CODES+2];

lib/libz/trees.h

3

local const ct_data static_ltree[L_CODES+2] = {

sys/lib/libz/deflate.h

211

int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */

sys/lib/libz/deflate.h

218

uch depth[2*L_CODES+1];

sys/lib/libz/deflate.h

47

#define HEAP_SIZE (2*L_CODES+1)

sys/lib/libz/trees.c

130

{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};

sys/lib/libz/trees.c

359

gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);

sys/lib/libz/trees.c

395

for (i = 0; i < L_CODES+2; i++) {

sys/lib/libz/trees.c

397

static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));

sys/lib/libz/trees.c

442

for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;

sys/lib/libz/trees.c

836

Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,

sys/lib/libz/trees.c

84

local ct_data static_ltree[L_CODES+2];

sys/lib/libz/trees.h

3

local const ct_data static_ltree[L_CODES+2] = {