Lines Matching refs:Freq
444 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
445 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
446 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
448 s->dyn_ltree[END_BLOCK].Freq = 1;
473 (tree[n].Freq < tree[m].Freq || \
474 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
553 f = tree[n].Freq;
588 *(long)tree[m].Freq;
664 if (tree[n].Freq != 0) {
679 tree[node].Freq = 1;
703 tree[node].Freq = tree[n].Freq + tree[m].Freq;
710 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
755 s->bl_tree[curlen].Freq += count;
757 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
758 s->bl_tree[REP_3_6].Freq++;
760 s->bl_tree[REPZ_3_10].Freq++;
762 s->bl_tree[REPZ_11_138].Freq++;
1058 s->dyn_ltree[lc].Freq++;
1067 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1068 s->dyn_dtree[d_code(dist)].Freq++;
1079 out_length += (ulg)s->dyn_dtree[dcode].Freq *
1151 * IN assertion: the fields Freq of dyn_ltree are set.
1159 if (s->dyn_ltree[n].Freq != 0)
1163 if (s->dyn_ltree[n].Freq != 0)