Lines Matching refs:Freq
333 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
334 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
335 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
337 s->dyn_ltree[END_BLOCK].Freq = 1;
362 (tree[n].Freq < tree[m].Freq || \
363 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
444 f = tree[n].Freq;
479 *(long)tree[m].Freq;
557 if (tree[n].Freq != 0) {
572 tree[node].Freq = 1;
596 tree[node].Freq = tree[n].Freq + tree[m].Freq;
602 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
648 s->bl_tree[curlen].Freq += count;
650 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
651 s->bl_tree[REP_3_6].Freq++;
653 s->bl_tree[REPZ_3_10].Freq++;
655 s->bl_tree[REPZ_11_138].Freq++;
979 s->dyn_ltree[lc].Freq++;
988 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
989 s->dyn_dtree[d_code(dist)].Freq++;
999 out_length += (ulg)s->dyn_dtree[dcode].Freq *
1079 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
1080 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
1081 while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;