Lines Matching refs:dyn_ltree
313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1745 s->l_desc.dyn_tree = s->dyn_ltree;
1775 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
1779 s->dyn_ltree[END_BLOCK].Freq = 1;
2166 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2214 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2383 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2412 s->dyn_ltree[lc].Freq++;
2421 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
2501 * IN assertion: the fields freq of dyn_ltree are set and the total of all
2510 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
2511 while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
2512 while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;