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