OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:bl_tree
(Results
1 - 6
of
6
) sorted by null
/external/qemu/distrib/zlib-1.2.3/
trees.c
393
s->bl_desc.dyn_tree = s->
bl_tree
;
419
for (n = 0; n < BL_CODES; n++) s->
bl_tree
[n].Freq = 0;
681
if (tree == s->
bl_tree
) {
728
s->
bl_tree
[curlen].Freq += count;
730
if (curlen != prevlen) s->
bl_tree
[curlen].Freq++;
731
s->
bl_tree
[REP_3_6].Freq++;
733
s->
bl_tree
[REPZ_3_10].Freq++;
735
s->
bl_tree
[REPZ_11_138].Freq++;
750
*
bl_tree
.
773
do { send_code(s, curlen, s->
bl_tree
); } while (--count != 0)
[
all
...]
deflate.h
194
struct ct_data_s
bl_tree
[2*BL_CODES+1]; /* Huffman tree for bit lengths */
member in struct:internal_state
deflate.c
[
all
...]
/external/zlib/
trees.c
397
s->bl_desc.dyn_tree = s->
bl_tree
;
423
for (n = 0; n < BL_CODES; n++) s->
bl_tree
[n].Freq = 0;
685
if (tree == s->
bl_tree
) {
732
s->
bl_tree
[curlen].Freq += count;
734
if (curlen != prevlen) s->
bl_tree
[curlen].Freq++;
735
s->
bl_tree
[REP_3_6].Freq++;
737
s->
bl_tree
[REPZ_3_10].Freq++;
739
s->
bl_tree
[REPZ_11_138].Freq++;
754
*
bl_tree
.
777
do { send_code(s, curlen, s->
bl_tree
); } while (--count != 0)
[
all
...]
deflate.h
194
struct ct_data_s
bl_tree
[2*BL_CODES+1]; /* Huffman tree for bit lengths */
member in struct:internal_state
deflate.c
[
all
...]
Completed in 25 milliseconds