Lines Matching refs:Freq
230 #define Freq fc.freq
564 for (n = 0; n < L_CODES; n++) dyn_ltree[n].Freq = 0;
565 for (n = 0; n < D_CODES; n++) dyn_dtree[n].Freq = 0;
566 for (n = 0; n < BL_CODES; n++) bl_tree[n].Freq = 0;
568 dyn_ltree[END_BLOCK].Freq = 1;
594 (tree[n].Freq < tree[m].Freq || \
595 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
674 f = tree[n].Freq;
708 opt_len += ((long)bits-(long)tree[m].Len)*(long)tree[m].Freq;
782 if (tree[n].Freq != 0) {
797 tree[new].Freq = 1;
820 tree[node].Freq = (ush)(tree[n].Freq + tree[m].Freq);
826 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
872 bl_tree[curlen].Freq += (ush)count;
874 if (curlen != prevlen) bl_tree[curlen].Freq++;
875 bl_tree[REP_3_6].Freq++;
877 bl_tree[REPZ_3_10].Freq++;
879 bl_tree[REPZ_11_138].Freq++;
1151 dyn_ltree[lc].Freq++;
1159 dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
1160 dyn_dtree[d_code(dist)].Freq++;
1179 out_length += (ulg)dyn_dtree[dcode].Freq*(5L+extra_dbits[dcode]);
1276 if ((mask & 1) && (dyn_ltree[n].Freq != 0))
1284 if (dyn_ltree[9].Freq != 0 || dyn_ltree[10].Freq != 0
1285 || dyn_ltree[13].Freq != 0)
1288 if (dyn_ltree[n].Freq != 0)