333     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;  in init_block()
334     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;  in init_block()
335     for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;  in init_block()
337     s->dyn_ltree[END_BLOCK].Freq = 1;  in init_block()
362    (tree[n].Freq < tree[m].Freq || \
363    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
444         f = tree[n].Freq;  in gen_bitlen()
479                               *(long)tree[m].Freq;  in gen_bitlen()
557         if (tree[n].Freq != 0) {  in build_tree()
572         tree[node].Freq = 1;  in build_tree()
596         tree[node].Freq = tree[n].Freq + tree[m].Freq;  in build_tree()
602                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);  in build_tree()
648             s->bl_tree[curlen].Freq += count;  in scan_tree()
650             if (curlen != prevlen) s->bl_tree[curlen].Freq++;  in scan_tree()
651             s->bl_tree[REP_3_6].Freq++;  in scan_tree()
653             s->bl_tree[REPZ_3_10].Freq++;  in scan_tree()
655             s->bl_tree[REPZ_11_138].Freq++;  in scan_tree()
979         s->dyn_ltree[lc].Freq++;
988         s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
989         s->dyn_dtree[d_code(dist)].Freq++;
999             out_length += (ulg)s->dyn_dtree[dcode].Freq *
1079     while (n < 7)        bin_freq += s->dyn_ltree[n++].Freq;
1080     while (n < 128)    ascii_freq += s->dyn_ltree[n++].Freq;
1081     while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;