sbin/hammer2/zlib/hammer2_zlib_deflate.h

197

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

sbin/hammer2/zlib/hammer2_zlib_deflate.h

204

uch depth[2*L_CODES+1];

sbin/hammer2/zlib/hammer2_zlib_deflate.h

37

#define HEAP_SIZE (2*L_CODES+1)

sbin/hammer2/zlib/hammer2_zlib_trees.c

126

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

302

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

340

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

342

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

419

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

850

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

sbin/hammer2/zlib/hammer2_zlib_trees.c

86

local ct_data static_ltree[L_CODES+2];

sbin/hammer2/zlib/hammer2_zlib_trees.h

3

local const ct_data static_ltree[L_CODES+2] = {

sys/net/zlib.c

1910

local ct_data static_ltree[L_CODES+2];

sys/net/zlib.c

1946

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

sys/net/zlib.c

2118

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

sys/net/zlib.c

2167

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

sys/net/zlib.c

2609

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

sys/net/zlib.c

309

#define HEAP_SIZE (2*L_CODES+1)

sys/net/zlib.c

462

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

sys/net/zlib.c

469

uch depth[2*L_CODES+1];

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

197

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

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

204

uch depth[2*L_CODES+1];

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

37

#define HEAP_SIZE (2*L_CODES+1)

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

126

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

302

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

340

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

342

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

419

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

850

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

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

86

local ct_data static_ltree[L_CODES+2];

sys/vfs/hammer2/zlib/hammer2_zlib_trees.h

3

local const ct_data static_ltree[L_CODES+2] = {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

197

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

204

uch depth[2*L_CODES+1];

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

37

#define HEAP_SIZE (2*L_CODES+1)

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

126

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

302

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

340

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

342

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

419

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

850

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

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

86

local ct_data static_ltree[L_CODES+2];

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.h

3

local const ct_data static_ltree[L_CODES+2] = {