Lines Matching refs:Freq
851 #define Freq fc.freq
1000 G2.dyn_ltree[n].Freq = 0;
1002 G2.dyn_dtree[n].Freq = 0;
1004 G2.bl_tree[n].Freq = 0;
1006 G2.dyn_ltree[END_BLOCK].Freq = 1;
1024 (tree[n].Freq < tree[m].Freq \
1025 || (tree[n].Freq == tree[m].Freq && G2.depth[n] <= G2.depth[m]))
1102 f = tree[n].Freq;
1141 G2.opt_len += ((int32_t) bits - tree[m].Len) * tree[m].Freq;
1233 if (tree[n].Freq != 0) {
1249 tree[new].Freq = 1;
1275 tree[node].Freq = tree[n].Freq + tree[m].Freq;
1281 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
1331 G2.bl_tree[curlen].Freq += count;
1334 G2.bl_tree[curlen].Freq++;
1335 G2.bl_tree[REP_3_6].Freq++;
1337 G2.bl_tree[REPZ_3_10].Freq++;
1339 G2.bl_tree[REPZ_11_138].Freq++;
1488 G2.dyn_ltree[lc].Freq++;
1497 G2.dyn_ltree[G2.length_code[lc] + LITERALS + 1].Freq++;
1498 G2.dyn_dtree[D_CODE(dist)].Freq++;
1519 out_length += G2.dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]);