Freq 312 lib/zlib/deflate.h s->dyn_ltree[cc].Freq++; \
Freq 321 lib/zlib/deflate.h s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Freq 322 lib/zlib/deflate.h s->dyn_dtree[d_code(dist)].Freq++; \
Freq 417 lib/zlib/trees.c for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
Freq 418 lib/zlib/trees.c for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
Freq 419 lib/zlib/trees.c for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
Freq 421 lib/zlib/trees.c s->dyn_ltree[END_BLOCK].Freq = 1;
Freq 446 lib/zlib/trees.c (tree[n].Freq < tree[m].Freq || \
Freq 447 lib/zlib/trees.c (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
Freq 526 lib/zlib/trees.c f = tree[n].Freq;
Freq 561 lib/zlib/trees.c *(long)tree[m].Freq;
Freq 637 lib/zlib/trees.c if (tree[n].Freq != 0) {
Freq 652 lib/zlib/trees.c tree[node].Freq = 1;
Freq 676 lib/zlib/trees.c tree[node].Freq = tree[n].Freq + tree[m].Freq;
Freq 683 lib/zlib/trees.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
Freq 728 lib/zlib/trees.c s->bl_tree[curlen].Freq += count;
Freq 730 lib/zlib/trees.c if (curlen != prevlen) s->bl_tree[curlen].Freq++;
Freq 731 lib/zlib/trees.c s->bl_tree[REP_3_6].Freq++;
Freq 733 lib/zlib/trees.c s->bl_tree[REPZ_3_10].Freq++;
Freq 735 lib/zlib/trees.c s->bl_tree[REPZ_11_138].Freq++;
Freq 1031 lib/zlib/trees.c s->dyn_ltree[lc].Freq++;
Freq 1040 lib/zlib/trees.c s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
Freq 1041 lib/zlib/trees.c s->dyn_dtree[d_code(dist)].Freq++;
Freq 1052 lib/zlib/trees.c out_length += (ulg)s->dyn_dtree[dcode].Freq *
Freq 1132 lib/zlib/trees.c if (s->dyn_ltree[n].Freq != 0)
Freq 1136 lib/zlib/trees.c if (s->dyn_ltree[n].Freq != 0)