Lines Matching refs:Freq
422 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
423 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
424 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
426 s->dyn_ltree[END_BLOCK].Freq = 1;
451 (tree[n].Freq < tree[m].Freq || \
452 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
531 f = tree[n].Freq;
566 *(long)tree[m].Freq;
642 if (tree[n].Freq != 0) {
657 tree[node].Freq = 1;
681 tree[node].Freq = tree[n].Freq + tree[m].Freq;
688 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
733 s->bl_tree[curlen].Freq += count;
735 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
736 s->bl_tree[REP_3_6].Freq++;
738 s->bl_tree[REPZ_3_10].Freq++;
740 s->bl_tree[REPZ_11_138].Freq++;
1036 s->dyn_ltree[lc].Freq++;
1045 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1046 s->dyn_dtree[d_code(dist)].Freq++;
1057 out_length += (ulg)s->dyn_dtree[dcode].Freq *
1150 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1154 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
1155 || s->dyn_ltree[13].Freq != 0)
1158 if (s->dyn_ltree[n].Freq != 0)