Lines Matching refs:Freq
417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
418 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
421 s->dyn_ltree[END_BLOCK].Freq = 1;
446 (tree[n].Freq < tree[m].Freq || \
447 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
526 f = tree[n].Freq;
561 *(long)tree[m].Freq;
637 if (tree[n].Freq != 0) {
652 tree[node].Freq = 1;
676 tree[node].Freq = tree[n].Freq + tree[m].Freq;
683 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
728 s->bl_tree[curlen].Freq += count;
730 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
731 s->bl_tree[REP_3_6].Freq++;
733 s->bl_tree[REPZ_3_10].Freq++;
735 s->bl_tree[REPZ_11_138].Freq++;
1031 s->dyn_ltree[lc].Freq++;
1040 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1041 s->dyn_dtree[d_code(dist)].Freq++;
1052 out_length += (ulg)s->dyn_dtree[dcode].Freq *
1124 * IN assertion: the fields Freq of dyn_ltree are set.
1132 if (s->dyn_ltree[n].Freq != 0)
1136 if (s->dyn_ltree[n].Freq != 0)