Freq 327 3rdparty/zlib/deflate.h s->dyn_ltree[cc].Freq++; \ Freq 336 3rdparty/zlib/deflate.h s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \ Freq 337 3rdparty/zlib/deflate.h s->dyn_dtree[d_code(dist)].Freq++; \ Freq 415 3rdparty/zlib/trees.c for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; Freq 416 3rdparty/zlib/trees.c for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; Freq 417 3rdparty/zlib/trees.c for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; Freq 419 3rdparty/zlib/trees.c s->dyn_ltree[END_BLOCK].Freq = 1; Freq 444 3rdparty/zlib/trees.c (tree[n].Freq < tree[m].Freq || \ Freq 445 3rdparty/zlib/trees.c (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) Freq 524 3rdparty/zlib/trees.c f = tree[n].Freq; Freq 559 3rdparty/zlib/trees.c *(long)tree[m].Freq; Freq 635 3rdparty/zlib/trees.c if (tree[n].Freq != 0) { Freq 650 3rdparty/zlib/trees.c tree[node].Freq = 1; Freq 674 3rdparty/zlib/trees.c tree[node].Freq = tree[n].Freq + tree[m].Freq; Freq 681 3rdparty/zlib/trees.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); Freq 726 3rdparty/zlib/trees.c s->bl_tree[curlen].Freq += count; Freq 728 3rdparty/zlib/trees.c if (curlen != prevlen) s->bl_tree[curlen].Freq++; Freq 729 3rdparty/zlib/trees.c s->bl_tree[REP_3_6].Freq++; Freq 731 3rdparty/zlib/trees.c s->bl_tree[REPZ_3_10].Freq++; Freq 733 3rdparty/zlib/trees.c s->bl_tree[REPZ_11_138].Freq++; Freq 1019 3rdparty/zlib/trees.c s->dyn_ltree[lc].Freq++; Freq 1028 3rdparty/zlib/trees.c s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; Freq 1029 3rdparty/zlib/trees.c s->dyn_dtree[d_code(dist)].Freq++; Freq 1040 3rdparty/zlib/trees.c out_length += (ulg)s->dyn_dtree[dcode].Freq * Freq 1132 3rdparty/zlib/trees.c if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0)) Freq 1136 3rdparty/zlib/trees.c if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0 Freq 1137 3rdparty/zlib/trees.c || s->dyn_ltree[13].Freq != 0) Freq 1140 3rdparty/zlib/trees.c if (s->dyn_ltree[n].Freq != 0)