common/dist/zlib/deflate.h

345

s->dyn_ltree[cc].Freq++; \

common/dist/zlib/deflate.h

354

s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \

common/dist/zlib/deflate.h

355

s->dyn_dtree[d_code(dist)].Freq++; \

common/dist/zlib/deflate.h

364

s->dyn_ltree[cc].Freq++; \

common/dist/zlib/deflate.h

374

s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \

common/dist/zlib/deflate.h

375

s->dyn_dtree[d_code(dist)].Freq++; \

common/dist/zlib/trees.c

1108

s->dyn_ltree[lc].Freq++;

common/dist/zlib/trees.c

1117

s->dyn_ltree[_length_code[lc] + LITERALS + 1].Freq++;

common/dist/zlib/trees.c

1118

s->dyn_dtree[d_code(dist)].Freq++;

common/dist/zlib/trees.c

446

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

common/dist/zlib/trees.c

447

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

common/dist/zlib/trees.c

448

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

common/dist/zlib/trees.c

450

s->dyn_ltree[END_BLOCK].Freq = 1;

common/dist/zlib/trees.c

502

(tree[n].Freq < tree[m].Freq || \

common/dist/zlib/trees.c

503

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

common/dist/zlib/trees.c

575

f = tree[n].Freq;

common/dist/zlib/trees.c

609

s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;

common/dist/zlib/trees.c

644

if (tree[n].Freq != 0) {

common/dist/zlib/trees.c

659

tree[node].Freq = 1;

common/dist/zlib/trees.c

683

tree[node].Freq = tree[n].Freq + tree[m].Freq;

common/dist/zlib/trees.c

690

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

common/dist/zlib/trees.c

731

s->bl_tree[curlen].Freq += (ush)count;

common/dist/zlib/trees.c

733

if (curlen != prevlen) s->bl_tree[curlen].Freq++;

common/dist/zlib/trees.c

734

s->bl_tree[REP_3_6].Freq++;

common/dist/zlib/trees.c

736

s->bl_tree[REPZ_3_10].Freq++;

common/dist/zlib/trees.c

738

s->bl_tree[REPZ_11_138].Freq++;

common/dist/zlib/trees.c

978

if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))

common/dist/zlib/trees.c

982

if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0

common/dist/zlib/trees.c

983

|| s->dyn_ltree[13].Freq != 0)

common/dist/zlib/trees.c

986

if (s->dyn_ltree[n].Freq != 0)

sys/net/zlib.c

2513

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

sys/net/zlib.c

2514

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

sys/net/zlib.c

2515

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

sys/net/zlib.c

2517

s->dyn_ltree[END_BLOCK].Freq = 1;

sys/net/zlib.c

2542

(tree[n].Freq < tree[m].Freq || \

sys/net/zlib.c

2543

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

sys/net/zlib.c

2620

f = tree[n].Freq;

sys/net/zlib.c

2655

*(long)tree[m].Freq;

sys/net/zlib.c

2729

if (tree[n].Freq != 0) {

sys/net/zlib.c

2744

tree[node].Freq = 1;

sys/net/zlib.c

2768

tree[node].Freq = tree[n].Freq + tree[m].Freq;

sys/net/zlib.c

2774

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

sys/net/zlib.c

2818

s->bl_tree[curlen].Freq += count;

sys/net/zlib.c

2820

if (curlen != prevlen) s->bl_tree[curlen].Freq++;

sys/net/zlib.c

2821

s->bl_tree[REP_3_6].Freq++;

sys/net/zlib.c

2823

s->bl_tree[REPZ_3_10].Freq++;

sys/net/zlib.c

2825

s->bl_tree[REPZ_11_138].Freq++;

sys/net/zlib.c

3125

s->dyn_ltree[lc].Freq++;

sys/net/zlib.c

3134

s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;

sys/net/zlib.c

3135

s->dyn_dtree[d_code(dist)].Freq++;

sys/net/zlib.c

3146

out_length += (ulg)s->dyn_dtree[dcode].Freq *

sys/net/zlib.c

3224

while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;

sys/net/zlib.c

3225

while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;

sys/net/zlib.c

3226

while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;

sys/net/zlib.c

586

s->dyn_ltree[cc].Freq++; \

sys/net/zlib.c

595

s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \

sys/net/zlib.c

596

s->dyn_dtree[d_code(dist)].Freq++; \