Home
last modified time | relevance | path

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

/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.c417 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;
633 if (tree[n].Freq != 0) {
648 tree[node].Freq = 1;
672 tree[node].Freq = tree[n].Freq + tree[m].Freq;
679 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
1025 s->dyn_ltree[lc].Freq++;
1119 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
H A Ddeflate.h77 #define Freq fc.freq macro
324 s->dyn_ltree[cc].Freq++; \
334 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
335 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
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;
1995 if (tree[n].Freq != 0) {
2010 tree[node].Freq = 1;
2034 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2040 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2088 s->bl_tree[REP_3_6].Freq++;
[all …]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c338 #define Freq fc.freq macro
609 s->dyn_ltree[cc].Freq++; \
2607 (tree[n].Freq < tree[m].Freq || \
2608 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2692 f = tree[n].Freq;
2820 if (tree[n].Freq != 0) {
2837 tree[node].Freq = 1;
2864 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2870 node, tree[node].Freq, n, tree[n].Freq, m,
2871 tree[m].Freq);
[all …]
/illumos-gate/usr/src/contrib/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++; \