Searched refs:Freq (Results 1 – 4 of 4) sorted by relevance
417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;418 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;421 s->dyn_ltree[END_BLOCK].Freq = 1;446 (tree[n].Freq < tree[m].Freq || \447 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))526 f = tree[n].Freq;561 *(long)tree[m].Freq;637 if (tree[n].Freq != 0) {652 tree[node].Freq = 1;[all …]
73 #define Freq fc.freq macro312 s->dyn_ltree[cc].Freq++; \321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \322 s->dyn_dtree[d_code(dist)].Freq++; \
195 #define Freq fc.freq macro1775 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;1779 s->dyn_ltree[END_BLOCK].Freq = 1;1804 (tree[n].Freq < tree[m].Freq || \1805 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))1884 f = tree[n].Freq;1919 *(long)tree[m].Freq;1995 if (tree[n].Freq != 0) {[all …]
340 #define Freq fc.freq macro611 s->dyn_ltree[cc].Freq++; \620 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \621 s->dyn_dtree[d_code(dist)].Freq++; \2578 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;2579 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;2580 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;2582 s->dyn_ltree[END_BLOCK].Freq = 1;2609 (tree[n].Freq < tree[m].Freq || \2610 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))[all …]