common/dist/zlib/deflate.h

215

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

common/dist/zlib/deflate.h

222

uch depth[2*L_CODES+1];

common/dist/zlib/deflate.h

51

#define HEAP_SIZE (2*L_CODES+1)

common/dist/zlib/trees.c

134

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

common/dist/zlib/trees.c

363

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

common/dist/zlib/trees.c

399

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

common/dist/zlib/trees.c

401

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

common/dist/zlib/trees.c

446

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

common/dist/zlib/trees.c

840

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

common/dist/zlib/trees.c

88

local ct_data static_ltree[L_CODES+2];

common/dist/zlib/trees.h

3

local const ct_data static_ltree[L_CODES+2] = {

sys/net/zlib.c

2060

local ct_data static_ltree[L_CODES+2];

sys/net/zlib.c

2092

local const ct_data static_ltree[L_CODES+2] = {

sys/net/zlib.c

2230

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

sys/net/zlib.c

2401

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

sys/net/zlib.c

2438

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

sys/net/zlib.c

2440

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

sys/net/zlib.c

2513

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

sys/net/zlib.c

2932

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

sys/net/zlib.c

323

#define HEAP_SIZE (2*L_CODES+1)

sys/net/zlib.c

476

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

sys/net/zlib.c

483

uch depth[2*L_CODES+1];