Home | History | Annotate | Download | only in net

Lines Matching defs:dyn_ltree

465     struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */
586     s->dyn_ltree[cc].Freq++; \
595     s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1259     ds->l_desc.dyn_tree = ds->dyn_ltree;
2484     s->l_desc.dyn_tree = s->dyn_ltree;
2513     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
2517     s->dyn_ltree[END_BLOCK].Freq = 1;
2897     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2944     send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
3091         compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree);
3125         s->dyn_ltree[lc].Freq++;
3134         s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
3216  * IN assertion: the fields freq of dyn_ltree are set and the total of all
3224     while (n < 7)        bin_freq += s->dyn_ltree[n++].Freq;
3225     while (n < 128)    ascii_freq += s->dyn_ltree[n++].Freq;
3226     while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;