Searched refs:dyn_ltree (Results 1 – 3 of 3) sorted by relevance
386 s->l_desc.dyn_tree = s->dyn_ltree;415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;419 s->dyn_ltree[END_BLOCK].Freq = 1;807 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);855 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */984 compress_block(s, (const ct_data *)s->dyn_ltree,1019 s->dyn_ltree[lc].Freq++;1028 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;1132 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))1136 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0[all …]
195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member327 s->dyn_ltree[cc].Freq++; \336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1061 ds->l_desc.dyn_tree = ds->dyn_ltree;