Home
last modified time | relevance | path

Searched refs:dyn_ltree (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/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++;
1015 * IN assertion: the fields freq of dyn_ltree are set and the total of all
1025 while (n < 7) bin_freq += s->dyn_ltree[
[all...]
H A Ddefutil.h170 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
/kernel/linux/linux-6.6/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++;
1015 * IN assertion: the fields freq of dyn_ltree are set and the total of all
1025 while (n < 7) bin_freq += s->dyn_ltree[
[all...]
H A Ddefutil.h170 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member

Completed in 6 milliseconds