Lines Matching refs:Freq
279 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
280 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
281 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
283 s->dyn_ltree[END_BLOCK].Freq = 1;
308 (tree[n].Freq < tree[m].Freq || \
309 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
390 f = tree[n].Freq;
425 *(long)tree[m].Freq;
503 if (tree[n].Freq != 0) {
518 tree[node].Freq = 1;
542 tree[node].Freq = tree[n].Freq + tree[m].Freq;
548 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
594 s->bl_tree[curlen].Freq += count;
596 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
597 s->bl_tree[REP_3_6].Freq++;
599 s->bl_tree[REPZ_3_10].Freq++;
601 s->bl_tree[REPZ_11_138].Freq++;
925 s->dyn_ltree[lc].Freq++;
934 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
935 s->dyn_dtree[d_code(dist)].Freq++;
945 out_length += (ulg)s->dyn_dtree[dcode].Freq *
1025 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
1026 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
1027 while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;