Lines Matching refs:Freq

421     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
422     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
423     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
425     s->dyn_ltree[END_BLOCK].Freq = 1;
450    (tree[n].Freq < tree[m].Freq || \
451    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
530         f = tree[n].Freq;
565                               *(long)tree[m].Freq;
641         if (tree[n].Freq != 0) {
656         tree[node].Freq = 1;
680         tree[node].Freq = tree[n].Freq + tree[m].Freq;
687                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
732             s->bl_tree[curlen].Freq += count;
734             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
735             s->bl_tree[REP_3_6].Freq++;
737             s->bl_tree[REPZ_3_10].Freq++;
739             s->bl_tree[REPZ_11_138].Freq++;
1035         s->dyn_ltree[lc].Freq++;
1044         s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1045         s->dyn_dtree[d_code(dist)].Freq++;
1056             out_length += (ulg)s->dyn_dtree[dcode].Freq *
1149         if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1153     if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
1154             || s->dyn_ltree[13].Freq != 0)
1157         if (s->dyn_ltree[n].Freq != 0)