Freq 333 lib/zlib_deflate/deftree.c for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; Freq 334 lib/zlib_deflate/deftree.c for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; Freq 335 lib/zlib_deflate/deftree.c for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; Freq 337 lib/zlib_deflate/deftree.c s->dyn_ltree[END_BLOCK].Freq = 1; Freq 362 lib/zlib_deflate/deftree.c (tree[n].Freq < tree[m].Freq || \ Freq 363 lib/zlib_deflate/deftree.c (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) Freq 444 lib/zlib_deflate/deftree.c f = tree[n].Freq; Freq 479 lib/zlib_deflate/deftree.c *(long)tree[m].Freq; Freq 557 lib/zlib_deflate/deftree.c if (tree[n].Freq != 0) { Freq 572 lib/zlib_deflate/deftree.c tree[node].Freq = 1; Freq 596 lib/zlib_deflate/deftree.c tree[node].Freq = tree[n].Freq + tree[m].Freq; Freq 602 lib/zlib_deflate/deftree.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); Freq 648 lib/zlib_deflate/deftree.c s->bl_tree[curlen].Freq += count; Freq 650 lib/zlib_deflate/deftree.c if (curlen != prevlen) s->bl_tree[curlen].Freq++; Freq 651 lib/zlib_deflate/deftree.c s->bl_tree[REP_3_6].Freq++; Freq 653 lib/zlib_deflate/deftree.c s->bl_tree[REPZ_3_10].Freq++; Freq 655 lib/zlib_deflate/deftree.c s->bl_tree[REPZ_11_138].Freq++; Freq 979 lib/zlib_deflate/deftree.c s->dyn_ltree[lc].Freq++; Freq 988 lib/zlib_deflate/deftree.c s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++; Freq 989 lib/zlib_deflate/deftree.c s->dyn_dtree[d_code(dist)].Freq++; Freq 999 lib/zlib_deflate/deftree.c out_length += (ulg)s->dyn_dtree[dcode].Freq * Freq 1079 lib/zlib_deflate/deftree.c while (n < 7) bin_freq += s->dyn_ltree[n++].Freq; Freq 1080 lib/zlib_deflate/deftree.c while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq; Freq 1081 lib/zlib_deflate/deftree.c while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;