Home
last modified time | relevance | path

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

/openbmc/linux/lib/zlib_deflate/
H A Ddeftree.c249 s->l_desc.dyn_tree = s->dyn_ltree; in zlib_tr_init()
279 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
283 s->dyn_ltree[END_BLOCK].Freq = 1; in init_block()
677 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); in build_bl_tree()
728 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ in send_all_trees()
895 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
925 s->dyn_ltree[lc].Freq++;
934 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
1025 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
1026 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
[all …]
H A Ddefutil.h170 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
/openbmc/u-boot/lib/zlib/
H A Dtrees.c391 s->l_desc.dyn_tree = s->dyn_ltree;
421 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
425 s->dyn_ltree[END_BLOCK].Freq = 1;
813 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
861 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1035 s->dyn_ltree[lc].Freq++;
1044 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1149 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1153 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
H A Ddeflate.h192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
323 s->dyn_ltree[cc].Freq++; \
332 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Ddeflate.c975 ds->l_desc.dyn_tree = ds->dyn_ltree;