Lines Matching refs:Freq
195 #define Freq fc.freq
1775 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
1779 s->dyn_ltree[END_BLOCK].Freq = 1;
1804 (tree[n].Freq < tree[m].Freq || \
1805 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
1884 f = tree[n].Freq;
1919 *(long)tree[m].Freq;
1995 if (tree[n].Freq != 0) {
2010 tree[node].Freq = 1;
2034 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2040 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2085 s->bl_tree[curlen].Freq += count;
2087 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2088 s->bl_tree[REP_3_6].Freq++;
2090 s->bl_tree[REPZ_3_10].Freq++;
2092 s->bl_tree[REPZ_11_138].Freq++;
2412 s->dyn_ltree[lc].Freq++;
2421 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
2422 s->dyn_dtree[d_code(dist)].Freq++;
2432 out_length += (ulg)s->dyn_dtree[dcode].Freq *
2510 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
2511 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
2512 while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;