Searched refs:Freq (Results 1 – 5 of 5) sorted by relevance
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;415 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;417 s->dyn_ltree[END_BLOCK].Freq = 1;442 (tree[n].Freq < tree[m].Freq || \443 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))522 f = tree[n].Freq;556 s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;633 if (tree[n].Freq != 0) {648 tree[node].Freq = 1;[all …]
77 #define Freq fc.freq macro324 s->dyn_ltree[cc].Freq++; \334 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \335 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 …]
338 #define Freq fc.freq macro609 s->dyn_ltree[cc].Freq++; \618 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \619 s->dyn_dtree[d_code(dist)].Freq++; \2576 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;2577 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;2578 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;2580 s->dyn_ltree[END_BLOCK].Freq = 1;2607 (tree[n].Freq < tree[m].Freq || \2608 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))[all …]
1283 #define Freq fc.freq macro1522 s->dyn_ltree[cc].Freq++; \1531 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \1532 s->dyn_dtree[d_code(dist)].Freq++; \