Lines Matching defs:Freq
340 #define Freq fc.freq
611 s->dyn_ltree[cc].Freq++; \
620 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
621 s->dyn_dtree[d_code(dist)].Freq++; \
2578 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2579 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2580 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2582 s->dyn_ltree[END_BLOCK].Freq = 1;
2609 (tree[n].Freq < tree[m].Freq || \
2610 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2694 f = tree[n].Freq;
2736 *(long)tree[m].Freq;
2822 if (tree[n].Freq != 0) {
2839 tree[node].Freq = 1;
2866 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2872 node, tree[node].Freq, n, tree[n].Freq, m,
2873 tree[m].Freq);
2921 s->bl_tree[curlen].Freq += count;
2923 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2924 s->bl_tree[REP_3_6].Freq++;
2926 s->bl_tree[REPZ_3_10].Freq++;
2928 s->bl_tree[REPZ_11_138].Freq++;
3314 s->dyn_ltree[lc].Freq++;
3323 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
3324 s->dyn_dtree[d_code(dist)].Freq++;
3335 out_length += (ulg)s->dyn_dtree[dcode].Freq *
3430 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
3431 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
3432 while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;