Searched refs:Freq (Results 1 - 6 of 6) sorted by relevance

/illumos-gate/usr/src/boot/lib/libz/
H A Dtrees.c415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
419 s->dyn_ltree[END_BLOCK].Freq = 1;
444 (tree[n].Freq < tree[m].Freq || \
445 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
524 f = tree[n].Freq;
559 *(long)tree[m].Freq;
[all...]
H A Ddeflate.h76 #define Freq fc.freq macro
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
337 s->dyn_dtree[d_code(dist)].Freq++; \
/illumos-gate/usr/src/uts/common/zmod/
H A Dtrees.c417 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;
[all...]
H A Ddeflate.h73 #define Freq fc.freq macro
312 s->dyn_ltree[cc].Freq++; \
321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
322 s->dyn_dtree[d_code(dist)].Freq++; \
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c195 #define Freq fc.freq macro
1775 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;
[all...]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c340 #define Freq fc.freq macro
611 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 || \
[all...]

Completed in 92 milliseconds