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[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++;
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;
s->opt_len += ((ulg)bits - tree[m].Len) * 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 += (ush)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++;
if ((block_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)
if (VPEClks[idx-1].Freq)
min_freq = (SOCClks[soc_dpm_level].Freq < VPEClks[soc_dpm_level].Freq) ?
SOCClks[soc_dpm_level].Freq : VPEClks[soc_dpm_level].Freq;
return clock_table->SocClocks[i].Freq;
return clock_table->DcfClocks[i].Freq;
if (clock_table->FClocks[i].Freq != 0 && clock_table->FClocks[i].Vol != 0) {
bw_params->clk_table.entries[i].fclk_mhz = clock_table->FClocks[j].Freq;
bw_params->clk_table.entries[i].memclk_mhz = clock_table->MemClocks[j].Freq;
uint16_t Freq; // in MHz
uint16_t Freq; // in MHz
uint16_t Freq; // in MHz
uint32_t Freq; // In MHz
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 */
uint16_t Freq; // in MHz
uint32_t Freq; // In MHz
uint16_t Freq; // in MHz
uint16_t Freq; // in MHz
uint16_t Freq; // in MHz
uint16_t Freq; // in MHz
clock_table->SocClocks[i].Freq = table->SocClocks[i];
clock_table->FClocks[i].Freq = table->DfPstateTable[i].fclk;
clock_table->MemClocks[i].Freq = table->DfPstateTable[i].memclk;
*freq = clk_table->SocClocks[dpm_level].Freq;
*freq = clk_table->FClocks[dpm_level].Freq;
*freq = clk_table->DcfClocks[dpm_level].Freq;
*freq = clk_table->FClocks[dpm_level].Freq;
*freq = clk_table->VClocks[dpm_level].Freq;
*freq = clk_table->DClocks[dpm_level].Freq;
clock_table->DcfClocks[i].Freq = table->DcfClocks[i].Freq;
clock_table->SocClocks[i].Freq = table->SocClocks[i].Freq;
clock_table->FClocks[i].Freq = table->FClocks[i].Freq;
clock_table->MemClocks[i].Freq = table->MemClocks[i].Freq;
clock_table->VClocks[i].Freq = table->VClocks[i].Freq;
clock_table->DClocks[i].Freq = table->DClocks[i].Freq;
clock_table->SocClocks[idx].Freq = (idx < clk_table->NumSocClkLevelsEnabled) ? clk_table->SocClocks[idx]:0;
clock_table->VPEClocks[idx].Freq = (idx < clk_table->VpeClkLevelsEnabled) ? clk_table->VPEClocks[idx]:0;
clock_table->SocClocks[idx].Freq = (idx < clk_table->NumSocClkLevelsEnabled) ? clk_table->SocClocks[idx]:0;
clock_table->VPEClocks[idx].Freq = (idx < clk_table->VpeClkLevelsEnabled) ? clk_table->VPEClocks[idx]:0;
s->dyn_ltree[cc].Freq++; \
s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
s->dyn_dtree[d_code(dist)].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++;
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;
s->opt_len += ((ulg)bits - tree[m].Len) * 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 += (ush)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++;
if ((block_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)