Freq
s->dyn_ltree[cc].Freq++; \
s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
s->dyn_dtree[d_code(dist)].Freq++; \
s->dyn_ltree[lc].Freq++;
s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
s->dyn_dtree[d_code(dist)].Freq++;
out_length += (ulg)s->dyn_dtree[dcode].Freq *
if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
|| s->dyn_ltree[13].Freq != 0)
if (s->dyn_ltree[n].Freq != 0)
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
s->dyn_ltree[END_BLOCK].Freq = 1;
(tree[n].Freq < tree[m].Freq || \
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
f = tree[n].Freq;
*(long)tree[m].Freq;
if (tree[n].Freq != 0) {
tree[node].Freq = 1;
tree[node].Freq = tree[n].Freq + tree[m].Freq;
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
s->bl_tree[curlen].Freq += count;
if (curlen != prevlen) s->bl_tree[curlen].Freq++;
s->bl_tree[REP_3_6].Freq++;
s->bl_tree[REPZ_3_10].Freq++;
s->bl_tree[REPZ_11_138].Freq++;
ptable->entries[i].clk = pclk_dependency_table->Freq * 100;
if (0 == result && table->DcefClocks[0].Freq != 0) {
if (min_mclk < data->clock_table.FClocks[0].Freq)
min_mclk = data->clock_table.FClocks[0].Freq;
pp_table->DisplayClockTable[disp_clock][i].Freq =
pp_table->DisplayClockTable[disp_clock][i].Freq =
uint32_t Freq; /* In MHz */
uint16_t Freq;
uint16_t Freq; /* in MHz */
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
s->dyn_ltree[END_BLOCK].Freq = 1;
(tree[n].Freq < tree[m].Freq || \
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
f = tree[n].Freq;
*(long)tree[m].Freq;
if (tree[n].Freq != 0) {
tree[node].Freq = 1;
tree[node].Freq = tree[n].Freq + tree[m].Freq;
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
s->bl_tree[curlen].Freq += count;
if (curlen != prevlen) s->bl_tree[curlen].Freq++;
s->bl_tree[REP_3_6].Freq++;
s->bl_tree[REPZ_3_10].Freq++;
s->bl_tree[REPZ_11_138].Freq++;
s->dyn_ltree[lc].Freq++;
s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
s->dyn_dtree[d_code(dist)].Freq++;
out_length += (ulg)s->dyn_dtree[dcode].Freq *
while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;
s->dyn_ltree[cc].Freq++; \
s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
s->dyn_dtree[d_code(dist)].Freq++; \
s->dyn_ltree[lc].Freq++;
s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
s->dyn_dtree[d_code(dist)].Freq++;
out_length += (ulg)s->dyn_dtree[dcode].Freq *
if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
|| s->dyn_ltree[13].Freq != 0)
if (s->dyn_ltree[n].Freq != 0)
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
s->dyn_ltree[END_BLOCK].Freq = 1;
(tree[n].Freq < tree[m].Freq || \
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
f = tree[n].Freq;
*(long)tree[m].Freq;
if (tree[n].Freq != 0) {
tree[node].Freq = 1;
tree[node].Freq = tree[n].Freq + tree[m].Freq;
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
s->bl_tree[curlen].Freq += count;
if (curlen != prevlen) s->bl_tree[curlen].Freq++;
s->bl_tree[REP_3_6].Freq++;
s->bl_tree[REPZ_3_10].Freq++;
s->bl_tree[REPZ_11_138].Freq++;
s->dyn_ltree[cc].Freq++; \
s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
s->dyn_dtree[d_code(dist)].Freq++; \
s->dyn_ltree[lc].Freq++;
s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
s->dyn_dtree[d_code(dist)].Freq++;
out_length += (ulg)s->dyn_dtree[dcode].Freq *
if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
|| s->dyn_ltree[13].Freq != 0)
if (s->dyn_ltree[n].Freq != 0)
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
s->dyn_ltree[END_BLOCK].Freq = 1;
(tree[n].Freq < tree[m].Freq || \
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
f = tree[n].Freq;
*(long)tree[m].Freq;
if (tree[n].Freq != 0) {
tree[node].Freq = 1;
tree[node].Freq = tree[n].Freq + tree[m].Freq;
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
s->bl_tree[curlen].Freq += count;
if (curlen != prevlen) s->bl_tree[curlen].Freq++;
s->bl_tree[REP_3_6].Freq++;
s->bl_tree[REPZ_3_10].Freq++;
s->bl_tree[REPZ_11_138].Freq++;