Lines Matching refs:Freq

413     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
414     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
415     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
417     s->dyn_ltree[END_BLOCK].Freq = 1;
442    (tree[n].Freq < tree[m].Freq || \
443    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
522         f = tree[n].Freq;
556                 s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;
633         if (tree[n].Freq != 0) {
648         tree[node].Freq = 1;
672         tree[node].Freq = tree[n].Freq + tree[m].Freq;
679                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
724             s->bl_tree[curlen].Freq += count;
726             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
727             s->bl_tree[REP_3_6].Freq++;
729             s->bl_tree[REPZ_3_10].Freq++;
731             s->bl_tree[REPZ_11_138].Freq++;
1025         s->dyn_ltree[lc].Freq++;
1034         s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1035         s->dyn_dtree[d_code(dist)].Freq++;
1115         if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1119     if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
1120             || s->dyn_ltree[13].Freq != 0)
1123         if (s->dyn_ltree[n].Freq != 0)