Lines Matching refs:Freq

415     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
416     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
417     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
419     s->dyn_ltree[END_BLOCK].Freq = 1;
444    (tree[n].Freq < tree[m].Freq || \
445    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
524         f = tree[n].Freq;
559                               *(long)tree[m].Freq;
635         if (tree[n].Freq != 0) {
650         tree[node].Freq = 1;
674         tree[node].Freq = tree[n].Freq + tree[m].Freq;
681                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
726             s->bl_tree[curlen].Freq += count;
728             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
729             s->bl_tree[REP_3_6].Freq++;
731             s->bl_tree[REPZ_3_10].Freq++;
733             s->bl_tree[REPZ_11_138].Freq++;
1019         s->dyn_ltree[lc].Freq++;
1028         s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1029         s->dyn_dtree[d_code(dist)].Freq++;
1040             out_length += (ulg)s->dyn_dtree[dcode].Freq *
1132         if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1136     if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
1137             || s->dyn_ltree[13].Freq != 0)
1140         if (s->dyn_ltree[n].Freq != 0)