Lines Matching refs:Freq
320 #define Freq fc.freq
2173 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2174 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2175 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2177 s->dyn_ltree[END_BLOCK].Freq = 1;
2202 (tree[n].Freq < tree[m].Freq || \
2203 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2282 f = tree[n].Freq;
2317 *(long)tree[m].Freq;
2393 if (tree[n].Freq != 0) {
2408 tree[node].Freq = 1;
2432 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2438 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2483 s->bl_tree[curlen].Freq += count;
2485 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2486 s->bl_tree[REP_3_6].Freq++;
2488 s->bl_tree[REPZ_3_10].Freq++;
2490 s->bl_tree[REPZ_11_138].Freq++;
2804 s->dyn_ltree[lc].Freq++;
2813 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
2814 s->dyn_dtree[d_code(dist)].Freq++;
2824 out_length += (ulg)s->dyn_dtree[dcode].Freq *
2902 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
2903 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
2904 while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;