448     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;  in init_block()
449     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;  in init_block()
450     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;  in init_block()
452     s->dyn_ltree[END_BLOCK].Freq = 1;  in init_block()
477    (tree[n].Freq < tree[m].Freq || \
478    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
561         f = tree[n].Freq;  in gen_bitlen()
596                               *(long)tree[m].Freq;  in gen_bitlen()
676         if (tree[n].Freq != 0) {  in build_tree()
691         tree[node].Freq = 1;  in build_tree()
715         tree[node].Freq = tree[n].Freq + tree[m].Freq;  in build_tree()
722                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);  in build_tree()
771             s->bl_tree[curlen].Freq += count;  in scan_tree()
773             if (curlen != prevlen) s->bl_tree[curlen].Freq++;  in scan_tree()
774             s->bl_tree[REP_3_6].Freq++;  in scan_tree()
776             s->bl_tree[REPZ_3_10].Freq++;  in scan_tree()
778             s->bl_tree[REPZ_11_138].Freq++;  in scan_tree()
1090         s->dyn_ltree[lc].Freq++;
1099         s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1100         s->dyn_dtree[d_code(dist)].Freq++;
1111             out_length += (ulg)s->dyn_dtree[dcode].Freq *
1201         if (s->dyn_ltree[n].Freq != 0)
1205             if (s->dyn_ltree[n].Freq != 0)