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

/ast/src/lib/libz/
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++; \
/ast/src/cmd/vczip/tests/
H A Dtvcbwzip.c23 static int Freq[256] = variable
54 { for(n = 0; n < Freq[k] && b < endb; ++n)
H A Dtvchuff.c23 static int Freq[256] = variable
90 { for(n = 0; n < Freq[k]; ++n)
105 { for(n = 0; n < Freq[k] && b < endb; ++n)
/ast/src/cmd/INIT/
H A Dratz.c1283 #define Freq fc.freq macro
1522 s->dyn_ltree[cc].Freq++; \
1531 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1532 s->dyn_dtree[d_code(dist)].Freq++; \

Completed in 28 milliseconds