Lines Matching refs:Freq
279 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
280 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
281 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
283 s->dyn_ltree[END_BLOCK].Freq = 1; in init_block()
308 (tree[n].Freq < tree[m].Freq || \
309 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
390 f = tree[n].Freq; in gen_bitlen()
425 *(long)tree[m].Freq; in gen_bitlen()
503 if (tree[n].Freq != 0) { in build_tree()
518 tree[node].Freq = 1; in build_tree()
542 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
548 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); in build_tree()
594 s->bl_tree[curlen].Freq += count; in scan_tree()
596 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
597 s->bl_tree[REP_3_6].Freq++; in scan_tree()
599 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
601 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
925 s->dyn_ltree[lc].Freq++;
934 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
935 s->dyn_dtree[d_code(dist)].Freq++;
945 out_length += (ulg)s->dyn_dtree[dcode].Freq *
1025 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
1026 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
1027 while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;