Freq 1787 net/zlib.c for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; Freq 1788 net/zlib.c for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; Freq 1789 net/zlib.c for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; Freq 1791 net/zlib.c s->dyn_ltree[END_BLOCK].Freq = 1; Freq 1816 net/zlib.c (tree[n].Freq < tree[m].Freq || \ Freq 1817 net/zlib.c (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) Freq 1896 net/zlib.c f = tree[n].Freq; Freq 1931 net/zlib.c *(long)tree[m].Freq; Freq 2007 net/zlib.c if (tree[n].Freq != 0) { Freq 2022 net/zlib.c tree[node].Freq = 1; Freq 2046 net/zlib.c tree[node].Freq = tree[n].Freq + tree[m].Freq; Freq 2052 net/zlib.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); Freq 2097 net/zlib.c s->bl_tree[curlen].Freq += count; Freq 2099 net/zlib.c if (curlen != prevlen) s->bl_tree[curlen].Freq++; Freq 2100 net/zlib.c s->bl_tree[REP_3_6].Freq++; Freq 2102 net/zlib.c s->bl_tree[REPZ_3_10].Freq++; Freq 2104 net/zlib.c s->bl_tree[REPZ_11_138].Freq++; Freq 2424 net/zlib.c s->dyn_ltree[lc].Freq++; Freq 2433 net/zlib.c s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++; Freq 2434 net/zlib.c s->dyn_dtree[d_code(dist)].Freq++; Freq 2444 net/zlib.c out_length += (ulg)s->dyn_dtree[dcode].Freq * Freq 2522 net/zlib.c while (n < 7) bin_freq += s->dyn_ltree[n++].Freq; Freq 2523 net/zlib.c while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq; Freq 2524 net/zlib.c while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;